./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3291167999bb7bd7f68091110884d1151ee296ff17c178c4f709963149d4b67b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:08:16,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:08:16,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:08:16,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:08:16,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:08:16,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:08:16,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:08:16,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:08:16,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:08:16,162 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:08:16,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:08:16,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:08:16,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:08:16,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:08:16,162 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:08:16,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:08:16,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:08:16,163 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:08:16,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:08:16,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:08:16,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:08:16,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:08:16,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:08:16,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:08:16,164 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:08:16,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:08:16,164 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:08:16,164 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:08:16,164 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:08:16,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:08:16,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:08:16,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:08:16,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:08:16,165 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:08:16,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:08:16,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:08:16,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:08:16,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:08:16,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:08:16,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:08:16,166 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:08:16,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:08:16,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:08:16,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:08:16,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:08:16,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:08:16,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:08:16,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:08:16,167 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3291167999bb7bd7f68091110884d1151ee296ff17c178c4f709963149d4b67b [2025-01-09 16:08:16,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:08:16,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:08:16,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:08:16,456 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:08:16,457 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:08:16,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i [2025-01-09 16:08:17,747 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26fcb2c59/e229b18e8f5e4880b4f9270092c7542b/FLAG6b0fcece7 [2025-01-09 16:08:18,096 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:08:18,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i [2025-01-09 16:08:18,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26fcb2c59/e229b18e8f5e4880b4f9270092c7542b/FLAG6b0fcece7 [2025-01-09 16:08:18,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26fcb2c59/e229b18e8f5e4880b4f9270092c7542b [2025-01-09 16:08:18,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:08:18,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:08:18,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:08:18,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:08:18,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:08:18,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:08:18" (1/1) ... [2025-01-09 16:08:18,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf8a272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:18, skipping insertion in model container [2025-01-09 16:08:18,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:08:18" (1/1) ... [2025-01-09 16:08:18,338 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:08:18,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i[917,930] [2025-01-09 16:08:18,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:08:18,517 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:08:18,525 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i[917,930] [2025-01-09 16:08:18,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:08:18,580 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:08:18,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:18 WrapperNode [2025-01-09 16:08:18,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:08:18,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:08:18,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:08:18,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:08:18,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:18" (1/1) ... [2025-01-09 16:08:18,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:18" (1/1) ... [2025-01-09 16:08:18,637 INFO L138 Inliner]: procedures = 30, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2025-01-09 16:08:18,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:08:18,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:08:18,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:08:18,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:08:18,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:18" (1/1) ... [2025-01-09 16:08:18,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:18" (1/1) ... [2025-01-09 16:08:18,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:18" (1/1) ... [2025-01-09 16:08:18,657 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:08:18,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:18" (1/1) ... [2025-01-09 16:08:18,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:18" (1/1) ... [2025-01-09 16:08:18,672 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:18" (1/1) ... [2025-01-09 16:08:18,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:18" (1/1) ... [2025-01-09 16:08:18,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:18" (1/1) ... [2025-01-09 16:08:18,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:18" (1/1) ... [2025-01-09 16:08:18,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:18" (1/1) ... [2025-01-09 16:08:18,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:08:18,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:08:18,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:08:18,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:08:18,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:18" (1/1) ... [2025-01-09 16:08:18,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:08:18,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:08:18,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:08:18,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:08:18,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:08:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:08:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:08:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:08:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:08:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:08:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:08:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:08:18,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:08:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:08:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:08:18,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:08:18,879 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:08:18,880 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:08:19,362 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2025-01-09 16:08:19,362 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:08:19,377 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:08:19,378 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:08:19,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:08:19 BoogieIcfgContainer [2025-01-09 16:08:19,378 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:08:19,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:08:19,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:08:19,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:08:19,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:08:18" (1/3) ... [2025-01-09 16:08:19,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc0b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:08:19, skipping insertion in model container [2025-01-09 16:08:19,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:18" (2/3) ... [2025-01-09 16:08:19,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc0b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:08:19, skipping insertion in model container [2025-01-09 16:08:19,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:08:19" (3/3) ... [2025-01-09 16:08:19,392 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-26.i [2025-01-09 16:08:19,407 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:08:19,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-26.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:08:19,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:08:19,485 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4a48f4d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:08:19,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:08:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:19,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 16:08:19,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:19,497 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:19,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:19,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:19,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1342585027, now seen corresponding path program 1 times [2025-01-09 16:08:19,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:19,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682390143] [2025-01-09 16:08:19,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:19,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:19,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 16:08:19,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 16:08:19,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:19,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 16:08:19,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:19,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682390143] [2025-01-09 16:08:19,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682390143] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:08:19,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041081792] [2025-01-09 16:08:19,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:19,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:08:19,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:08:19,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:08:19,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:08:20,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 16:08:20,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 16:08:20,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:20,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:20,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:08:20,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 16:08:20,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:20,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041081792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:20,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:08:20,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:08:20,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387277844] [2025-01-09 16:08:20,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:20,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:08:20,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:20,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:08:20,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:08:20,173 INFO L87 Difference]: Start difference. First operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:08:20,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:20,203 INFO L93 Difference]: Finished difference Result 178 states and 268 transitions. [2025-01-09 16:08:20,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:08:20,205 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-01-09 16:08:20,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:20,214 INFO L225 Difference]: With dead ends: 178 [2025-01-09 16:08:20,214 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 16:08:20,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:08:20,220 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:20,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:20,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 16:08:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 16:08:20,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2025-01-09 16:08:20,261 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 89 [2025-01-09 16:08:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:20,262 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2025-01-09 16:08:20,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:08:20,262 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2025-01-09 16:08:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 16:08:20,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:20,265 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:20,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:08:20,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 16:08:20,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:20,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:20,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1000727727, now seen corresponding path program 1 times [2025-01-09 16:08:20,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:20,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496512500] [2025-01-09 16:08:20,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:20,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:20,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 16:08:20,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 16:08:20,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:20,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:20,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496512500] [2025-01-09 16:08:20,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496512500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:20,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:20,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:08:20,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464752587] [2025-01-09 16:08:20,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:20,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:08:20,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:20,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:08:20,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:08:20,811 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:20,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:20,849 INFO L93 Difference]: Finished difference Result 178 states and 255 transitions. [2025-01-09 16:08:20,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:08:20,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-01-09 16:08:20,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:20,851 INFO L225 Difference]: With dead ends: 178 [2025-01-09 16:08:20,851 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 16:08:20,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:08:20,852 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:20,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 363 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:20,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 16:08:20,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-01-09 16:08:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2025-01-09 16:08:20,862 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 89 [2025-01-09 16:08:20,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:20,866 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2025-01-09 16:08:20,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2025-01-09 16:08:20,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 16:08:20,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:20,868 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:20,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:08:20,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:20,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:20,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1002574769, now seen corresponding path program 1 times [2025-01-09 16:08:20,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:20,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825058287] [2025-01-09 16:08:20,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:20,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:20,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 16:08:21,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 16:08:21,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:21,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:21,312 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:21,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:21,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825058287] [2025-01-09 16:08:21,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825058287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:21,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:21,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:08:21,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626423562] [2025-01-09 16:08:21,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:21,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:08:21,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:21,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:08:21,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:21,316 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:21,342 INFO L93 Difference]: Finished difference Result 179 states and 255 transitions. [2025-01-09 16:08:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:08:21,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-01-09 16:08:21,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:21,347 INFO L225 Difference]: With dead ends: 179 [2025-01-09 16:08:21,348 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 16:08:21,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:21,349 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:21,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:21,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 16:08:21,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 16:08:21,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:21,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2025-01-09 16:08:21,363 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 89 [2025-01-09 16:08:21,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:21,367 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2025-01-09 16:08:21,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2025-01-09 16:08:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 16:08:21,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:21,369 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:21,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:08:21,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:21,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:21,370 INFO L85 PathProgramCache]: Analyzing trace with hash 184926319, now seen corresponding path program 1 times [2025-01-09 16:08:21,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:21,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187122530] [2025-01-09 16:08:21,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:21,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:21,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 16:08:21,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 16:08:21,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:21,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:21,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:21,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187122530] [2025-01-09 16:08:21,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187122530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:21,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:21,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:08:21,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160250483] [2025-01-09 16:08:21,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:21,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:08:21,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:21,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:08:21,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:21,652 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:21,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:21,784 INFO L93 Difference]: Finished difference Result 179 states and 253 transitions. [2025-01-09 16:08:21,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:08:21,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-01-09 16:08:21,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:21,786 INFO L225 Difference]: With dead ends: 179 [2025-01-09 16:08:21,786 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 16:08:21,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:21,787 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:21,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:08:21,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 16:08:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 16:08:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 127 transitions. [2025-01-09 16:08:21,816 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 127 transitions. Word has length 89 [2025-01-09 16:08:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:21,817 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 127 transitions. [2025-01-09 16:08:21,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 127 transitions. [2025-01-09 16:08:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 16:08:21,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:21,822 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:21,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:08:21,822 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:21,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:21,823 INFO L85 PathProgramCache]: Analyzing trace with hash -826190931, now seen corresponding path program 1 times [2025-01-09 16:08:21,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:21,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437470482] [2025-01-09 16:08:21,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:21,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:21,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 16:08:22,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 16:08:22,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:22,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:24,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:24,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437470482] [2025-01-09 16:08:24,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437470482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:24,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:24,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 16:08:24,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117634858] [2025-01-09 16:08:24,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:24,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 16:08:24,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:24,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 16:08:24,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:08:24,446 INFO L87 Difference]: Start difference. First operand 91 states and 127 transitions. Second operand has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 18 states have internal predecessors, (47), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 16:08:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:25,605 INFO L93 Difference]: Finished difference Result 222 states and 310 transitions. [2025-01-09 16:08:25,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:08:25,606 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 18 states have internal predecessors, (47), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 89 [2025-01-09 16:08:25,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:25,607 INFO L225 Difference]: With dead ends: 222 [2025-01-09 16:08:25,607 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 16:08:25,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:08:25,609 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 205 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:25,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 621 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 16:08:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 16:08:25,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 99. [2025-01-09 16:08:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2025-01-09 16:08:25,620 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 89 [2025-01-09 16:08:25,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:25,620 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2025-01-09 16:08:25,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 18 states have internal predecessors, (47), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 16:08:25,620 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2025-01-09 16:08:25,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 16:08:25,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:25,622 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:25,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:08:25,622 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:25,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:25,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1527255509, now seen corresponding path program 1 times [2025-01-09 16:08:25,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:25,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419017154] [2025-01-09 16:08:25,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:25,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:25,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 16:08:25,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 16:08:25,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:25,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:08:25,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1968022679] [2025-01-09 16:08:25,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:25,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:08:25,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:08:25,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:08:25,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:08:25,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 16:08:26,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 16:08:26,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:26,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:08:26,469 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:08:26,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 16:08:26,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 16:08:26,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:26,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:08:27,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:08:27,093 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:08:27,094 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:08:27,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:08:27,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:08:27,300 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 16:08:27,414 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:08:27,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:08:27 BoogieIcfgContainer [2025-01-09 16:08:27,417 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:08:27,417 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:08:27,417 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:08:27,418 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:08:27,418 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:08:19" (3/4) ... [2025-01-09 16:08:27,420 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 16:08:27,420 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:08:27,421 INFO L158 Benchmark]: Toolchain (without parser) took 9105.56ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 154.5MB in the beginning and 72.2MB in the end (delta: 82.3MB). Peak memory consumption was 119.8MB. Max. memory is 16.1GB. [2025-01-09 16:08:27,421 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:08:27,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.68ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 139.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:08:27,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.47ms. Allocated memory is still 201.3MB. Free memory was 139.2MB in the beginning and 135.5MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:08:27,422 INFO L158 Benchmark]: Boogie Preprocessor took 55.28ms. Allocated memory is still 201.3MB. Free memory was 135.5MB in the beginning and 132.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:08:27,422 INFO L158 Benchmark]: RCFGBuilder took 683.71ms. Allocated memory is still 201.3MB. Free memory was 132.7MB in the beginning and 97.7MB in the end (delta: 35.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 16:08:27,422 INFO L158 Benchmark]: TraceAbstraction took 8034.27ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 97.0MB in the beginning and 72.2MB in the end (delta: 24.7MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. [2025-01-09 16:08:27,422 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 243.3MB. Free memory was 72.2MB in the beginning and 72.2MB in the end (delta: 48.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:08:27,424 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.68ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 139.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.47ms. Allocated memory is still 201.3MB. Free memory was 139.2MB in the beginning and 135.5MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.28ms. Allocated memory is still 201.3MB. Free memory was 135.5MB in the beginning and 132.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 683.71ms. Allocated memory is still 201.3MB. Free memory was 132.7MB in the beginning and 97.7MB in the end (delta: 35.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8034.27ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 97.0MB in the beginning and 72.2MB in the end (delta: 24.7MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 243.3MB. Free memory was 72.2MB in the beginning and 72.2MB in the end (delta: 48.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryArithmeticFLOAToperation at line 61. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L47] signed short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] signed short int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L49] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L50] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L51] float* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L52] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L53] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L54] unsigned long int* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L55] signed long int* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L56] float* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); [L57] unsigned char last_1_WrapperStruct00_var_1_15 = 64; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=0, last_1_WrapperStruct00_var_1_15=64] [L100] isInitial = 1 [L101] FCALL initially() [L103] CALL updateLastVariables() [L93] EXPR WrapperStruct00.var_1_15 [L93] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L103] RET updateLastVariables() [L104] CALL updateVariables() [L77] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L78] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L78] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L78] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L80] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L81] EXPR WrapperStruct00.var_1_13 [L81] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L81] EXPR WrapperStruct00.var_1_13 [L81] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L81] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L81] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L81] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L82] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L83] EXPR WrapperStruct00.var_1_14 [L83] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L83] EXPR WrapperStruct00.var_1_14 [L83] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L83] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L83] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L83] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L84] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L87] WrapperStruct00.var_1_19 = __VERIFIER_nondet_long() [L88] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L89] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L90] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L104] RET updateVariables() [L105] CALL step() [L61] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L61] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L61] (*(WrapperStruct00_var_1_12_Pointer)) = ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer))) [L62] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L62] COND TRUE (- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4)))) [L63] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L63] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_16_Pointer)) [L65] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L65] (*(WrapperStruct00_var_1_20_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L66] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L66] EXPR \read(*WrapperStruct00_var_1_20_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L66] COND TRUE (*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer)) [L67] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L67] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L67] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L67] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L67] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L67] (*(WrapperStruct00_var_1_1_Pointer)) = (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) [L71] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L71] signed long int stepLocal_0 = (*(WrapperStruct00_var_1_15_Pointer)) + ((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))); [L72] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L72] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L72] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64, stepLocal_0=30] [L72] COND FALSE !(stepLocal_0 != ((*(WrapperStruct00_var_1_15_Pointer)) * ((*(WrapperStruct00_var_1_1_Pointer)) / (*(WrapperStruct00_var_1_19_Pointer))))) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_20_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR ((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))))))) [L96] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L96] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L96] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR ((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR (((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer))))) [L96] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L96] EXPR (((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR ((((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer)))))) && (((- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR (((((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer)))))) && (((- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1)) && ((((*(WrapperStruct00_var_1_15_Pointer)) + ((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) != ((*(WrapperStruct00_var_1_15_Pointer)) * ((*(WrapperStruct00_var_1_1_Pointer)) / (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) ? (10u) : (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR ((((((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer)))))) && (((- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1)) && ((((*(WrapperStruct00_var_1_15_Pointer)) + ((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) != ((*(WrapperStruct00_var_1_15_Pointer)) * ((*(WrapperStruct00_var_1_1_Pointer)) / (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) ? (10u) : (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96-L97] return ((((((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer)))))) && (((- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1)) && ((((*(WrapperStruct00_var_1_15_Pointer)) + ((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) != ((*(WrapperStruct00_var_1_15_Pointer)) * ((*(WrapperStruct00_var_1_1_Pointer)) / (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) ? (10u) : (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 207 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 206 mSDsluCounter, 1549 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 988 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 987 IncrementalHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 561 mSDtfsCounter, 987 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 36 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 712 NumberOfCodeBlocks, 712 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 528 ConstructedInterpolants, 0 QuantifiedInterpolants, 1558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 396 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 848/864 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 16:08:27,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3291167999bb7bd7f68091110884d1151ee296ff17c178c4f709963149d4b67b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:08:29,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:08:29,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 16:08:29,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:08:29,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:08:29,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:08:29,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:08:29,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:08:29,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:08:29,922 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:08:29,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:08:29,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:08:29,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:08:29,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:08:29,923 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:08:29,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:08:29,924 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:08:29,924 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:08:29,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:08:29,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:08:29,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:08:29,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:08:29,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:08:29,925 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 16:08:29,925 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 16:08:29,925 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 16:08:29,925 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:08:29,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:08:29,925 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:08:29,925 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:08:29,925 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:08:29,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:08:29,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:08:29,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:08:29,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:08:29,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:08:29,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:08:29,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:08:29,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:08:29,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:08:29,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:08:29,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:08:29,927 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:08:29,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:08:29,927 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 16:08:29,928 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 16:08:29,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:08:29,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:08:29,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:08:29,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:08:29,928 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3291167999bb7bd7f68091110884d1151ee296ff17c178c4f709963149d4b67b [2025-01-09 16:08:30,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:08:30,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:08:30,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:08:30,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:08:30,249 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:08:30,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i [2025-01-09 16:08:31,582 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4623c4325/e416aa1cff12450ea799397aed5e44e8/FLAG36467d6d1 [2025-01-09 16:08:31,827 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:08:31,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i [2025-01-09 16:08:31,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4623c4325/e416aa1cff12450ea799397aed5e44e8/FLAG36467d6d1 [2025-01-09 16:08:31,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4623c4325/e416aa1cff12450ea799397aed5e44e8 [2025-01-09 16:08:31,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:08:31,863 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:08:31,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:08:31,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:08:31,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:08:31,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:08:31" (1/1) ... [2025-01-09 16:08:31,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e4d8fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:31, skipping insertion in model container [2025-01-09 16:08:31,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:08:31" (1/1) ... [2025-01-09 16:08:31,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:08:32,026 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i[917,930] [2025-01-09 16:08:32,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:08:32,136 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:08:32,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i[917,930] [2025-01-09 16:08:32,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:08:32,216 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:08:32,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:32 WrapperNode [2025-01-09 16:08:32,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:08:32,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:08:32,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:08:32,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:08:32,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:32" (1/1) ... [2025-01-09 16:08:32,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:32" (1/1) ... [2025-01-09 16:08:32,273 INFO L138 Inliner]: procedures = 37, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 478 [2025-01-09 16:08:32,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:08:32,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:08:32,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:08:32,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:08:32,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:32" (1/1) ... [2025-01-09 16:08:32,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:32" (1/1) ... [2025-01-09 16:08:32,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:32" (1/1) ... [2025-01-09 16:08:32,320 INFO L175 MemorySlicer]: Split 130 memory accesses to 2 slices as follows [2, 128]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 22 writes are split as follows [0, 22]. [2025-01-09 16:08:32,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:32" (1/1) ... [2025-01-09 16:08:32,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:32" (1/1) ... [2025-01-09 16:08:32,345 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:32" (1/1) ... [2025-01-09 16:08:32,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:32" (1/1) ... [2025-01-09 16:08:32,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:32" (1/1) ... [2025-01-09 16:08:32,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:32" (1/1) ... [2025-01-09 16:08:32,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:32" (1/1) ... [2025-01-09 16:08:32,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:08:32,369 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:08:32,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:08:32,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:08:32,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:32" (1/1) ... [2025-01-09 16:08:32,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:08:32,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:08:32,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:08:32,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:08:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:08:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 16:08:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 16:08:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 16:08:32,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 16:08:32,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 16:08:32,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 16:08:32,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 16:08:32,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 16:08:32,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 16:08:32,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 16:08:32,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-01-09 16:08:32,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-01-09 16:08:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 16:08:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 16:08:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 16:08:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 16:08:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 16:08:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 16:08:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:08:32,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:08:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-01-09 16:08:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-01-09 16:08:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:08:32,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:08:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 16:08:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 16:08:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 16:08:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 16:08:32,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 16:08:32,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 16:08:32,567 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:08:32,568 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:08:34,038 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2025-01-09 16:08:34,038 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:08:34,048 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:08:34,051 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:08:34,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:08:34 BoogieIcfgContainer [2025-01-09 16:08:34,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:08:34,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:08:34,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:08:34,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:08:34,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:08:31" (1/3) ... [2025-01-09 16:08:34,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1be3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:08:34, skipping insertion in model container [2025-01-09 16:08:34,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:32" (2/3) ... [2025-01-09 16:08:34,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1be3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:08:34, skipping insertion in model container [2025-01-09 16:08:34,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:08:34" (3/3) ... [2025-01-09 16:08:34,063 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-26.i [2025-01-09 16:08:34,076 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:08:34,077 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-26.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:08:34,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:08:34,184 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5f67b56e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:08:34,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:08:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:34,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 16:08:34,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:34,199 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:34,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:34,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:34,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1094930748, now seen corresponding path program 1 times [2025-01-09 16:08:34,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:34,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015075470] [2025-01-09 16:08:34,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:34,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:34,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:34,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:08:34,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 16:08:34,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 16:08:34,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 16:08:34,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:34,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:34,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:08:34,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 16:08:34,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:34,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:34,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015075470] [2025-01-09 16:08:34,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015075470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:34,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:34,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:08:34,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224742375] [2025-01-09 16:08:34,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:34,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:08:34,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:34,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:08:34,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:08:34,712 INFO L87 Difference]: Start difference. First operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:08:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:34,736 INFO L93 Difference]: Finished difference Result 178 states and 268 transitions. [2025-01-09 16:08:34,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:08:34,738 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-01-09 16:08:34,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:34,745 INFO L225 Difference]: With dead ends: 178 [2025-01-09 16:08:34,745 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 16:08:34,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:08:34,754 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:34,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:34,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 16:08:34,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 16:08:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:34,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2025-01-09 16:08:34,793 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 89 [2025-01-09 16:08:34,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:34,793 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2025-01-09 16:08:34,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:08:34,794 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2025-01-09 16:08:34,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 16:08:34,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:34,798 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:34,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 16:08:34,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:34,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:35,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:35,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1248382006, now seen corresponding path program 1 times [2025-01-09 16:08:35,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:35,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211050479] [2025-01-09 16:08:35,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:35,001 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:35,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:35,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:08:35,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 16:08:35,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 16:08:35,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 16:08:35,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:35,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:35,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:08:35,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 16:08:35,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:35,451 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:35,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211050479] [2025-01-09 16:08:35,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211050479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:35,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:35,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:08:35,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183866292] [2025-01-09 16:08:35,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:35,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:08:35,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:35,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:08:35,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:08:35,456 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:08:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:35,818 INFO L93 Difference]: Finished difference Result 177 states and 254 transitions. [2025-01-09 16:08:35,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:08:35,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-01-09 16:08:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:35,827 INFO L225 Difference]: With dead ends: 177 [2025-01-09 16:08:35,827 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 16:08:35,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:08:35,828 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:35,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:08:35,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 16:08:35,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 16:08:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2025-01-09 16:08:35,837 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 89 [2025-01-09 16:08:35,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:35,839 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2025-01-09 16:08:35,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:08:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2025-01-09 16:08:35,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 16:08:35,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:35,842 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:35,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 16:08:36,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:36,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:36,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:36,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1665778612, now seen corresponding path program 1 times [2025-01-09 16:08:36,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:36,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186317175] [2025-01-09 16:08:36,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:36,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:36,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:36,051 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:08:36,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 16:08:36,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 16:08:36,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 16:08:36,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:36,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:36,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:08:36,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:36,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 16:08:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:36,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:36,546 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:36,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186317175] [2025-01-09 16:08:36,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186317175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:36,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:36,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:08:36,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220774745] [2025-01-09 16:08:36,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:36,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:08:36,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:36,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:08:36,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:36,550 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:36,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:36,816 INFO L93 Difference]: Finished difference Result 179 states and 255 transitions. [2025-01-09 16:08:36,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:08:36,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-01-09 16:08:36,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:36,818 INFO L225 Difference]: With dead ends: 179 [2025-01-09 16:08:36,818 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 16:08:36,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:36,819 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:36,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:08:36,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 16:08:36,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 16:08:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2025-01-09 16:08:36,826 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 89 [2025-01-09 16:08:36,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:36,826 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2025-01-09 16:08:36,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2025-01-09 16:08:36,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 16:08:36,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:36,827 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:36,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 16:08:37,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:37,032 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:37,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:37,033 INFO L85 PathProgramCache]: Analyzing trace with hash 848130162, now seen corresponding path program 1 times [2025-01-09 16:08:37,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:37,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959887228] [2025-01-09 16:08:37,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:37,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:37,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:37,036 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:08:37,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 16:08:37,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 16:08:37,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 16:08:37,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:37,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:37,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:08:37,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:37,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:37,439 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:37,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959887228] [2025-01-09 16:08:37,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959887228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:37,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:37,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:08:37,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806734110] [2025-01-09 16:08:37,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:37,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:08:37,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:37,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:08:37,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:08:37,441 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:37,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:37,496 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2025-01-09 16:08:37,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:08:37,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-01-09 16:08:37,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:37,498 INFO L225 Difference]: With dead ends: 184 [2025-01-09 16:08:37,498 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 16:08:37,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:08:37,499 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:37,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 471 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:37,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 16:08:37,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-01-09 16:08:37,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2025-01-09 16:08:37,505 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 89 [2025-01-09 16:08:37,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:37,506 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2025-01-09 16:08:37,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:37,506 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2025-01-09 16:08:37,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 16:08:37,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:37,507 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:37,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 16:08:37,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:37,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:37,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:37,712 INFO L85 PathProgramCache]: Analyzing trace with hash 849977204, now seen corresponding path program 1 times [2025-01-09 16:08:37,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:37,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222520625] [2025-01-09 16:08:37,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:37,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:37,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:37,717 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:08:37,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 16:08:37,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 16:08:38,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 16:08:38,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:38,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:38,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:08:38,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:38,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-01-09 16:08:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-01-09 16:08:38,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:38,193 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:38,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222520625] [2025-01-09 16:08:38,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222520625] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:38,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:38,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:08:38,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709421202] [2025-01-09 16:08:38,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:38,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:08:38,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:38,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:08:38,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:08:38,195 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:08:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:39,259 INFO L93 Difference]: Finished difference Result 188 states and 262 transitions. [2025-01-09 16:08:39,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:08:39,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-01-09 16:08:39,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:39,260 INFO L225 Difference]: With dead ends: 188 [2025-01-09 16:08:39,260 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 16:08:39,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:08:39,261 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 111 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:39,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 379 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 16:08:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 16:08:39,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-01-09 16:08:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 131 transitions. [2025-01-09 16:08:39,268 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 131 transitions. Word has length 89 [2025-01-09 16:08:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:39,268 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 131 transitions. [2025-01-09 16:08:39,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:08:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2025-01-09 16:08:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 16:08:39,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:39,269 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:39,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 16:08:39,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:39,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:39,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:39,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1601013838, now seen corresponding path program 1 times [2025-01-09 16:08:39,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:39,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165276732] [2025-01-09 16:08:39,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:39,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:39,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:39,478 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:08:39,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 16:08:39,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 16:08:39,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 16:08:39,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:39,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:39,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:08:39,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:39,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2025-01-09 16:08:39,864 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:39,865 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:39,865 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:39,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165276732] [2025-01-09 16:08:39,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165276732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:39,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:39,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:08:39,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265425056] [2025-01-09 16:08:39,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:39,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:08:39,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:39,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:08:39,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:39,866 INFO L87 Difference]: Start difference. First operand 95 states and 131 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:40,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:40,225 INFO L93 Difference]: Finished difference Result 185 states and 257 transitions. [2025-01-09 16:08:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:08:40,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2025-01-09 16:08:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:40,228 INFO L225 Difference]: With dead ends: 185 [2025-01-09 16:08:40,228 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 16:08:40,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:40,229 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:40,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 239 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:08:40,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 16:08:40,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 16:08:40,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 82 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:40,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2025-01-09 16:08:40,236 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 91 [2025-01-09 16:08:40,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:40,236 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2025-01-09 16:08:40,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:40,237 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2025-01-09 16:08:40,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 16:08:40,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:40,238 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:40,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-01-09 16:08:40,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:40,439 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:40,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:40,439 INFO L85 PathProgramCache]: Analyzing trace with hash -95731268, now seen corresponding path program 1 times [2025-01-09 16:08:40,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:40,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011529809] [2025-01-09 16:08:40,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:40,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:40,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:40,443 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:08:40,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 16:08:40,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 16:08:40,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 16:08:40,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:40,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:40,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:08:40,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:40,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 16:08:40,827 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:40,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:40,829 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:40,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011529809] [2025-01-09 16:08:40,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011529809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:40,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:40,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:08:40,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595521631] [2025-01-09 16:08:40,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:40,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:08:40,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:40,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:08:40,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:40,830 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:41,085 INFO L93 Difference]: Finished difference Result 183 states and 253 transitions. [2025-01-09 16:08:41,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:08:41,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-01-09 16:08:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:41,089 INFO L225 Difference]: With dead ends: 183 [2025-01-09 16:08:41,089 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 16:08:41,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:41,090 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:41,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:08:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 16:08:41,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 16:08:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.329268292682927) internal successors, (109), 82 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:41,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 127 transitions. [2025-01-09 16:08:41,102 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 127 transitions. Word has length 96 [2025-01-09 16:08:41,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:41,103 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 127 transitions. [2025-01-09 16:08:41,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:41,103 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 127 transitions. [2025-01-09 16:08:41,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 16:08:41,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:41,104 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:41,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 16:08:41,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:41,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:41,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:41,305 INFO L85 PathProgramCache]: Analyzing trace with hash 44817342, now seen corresponding path program 1 times [2025-01-09 16:08:41,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:41,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533059270] [2025-01-09 16:08:41,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:41,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:41,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:41,307 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:08:41,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-01-09 16:08:41,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 16:08:41,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 16:08:41,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:41,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:41,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:08:41,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:41,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 16:08:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:41,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:41,813 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:41,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533059270] [2025-01-09 16:08:41,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533059270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:41,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:41,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:08:41,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247953432] [2025-01-09 16:08:41,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:41,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:08:41,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:41,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:08:41,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:41,815 INFO L87 Difference]: Start difference. First operand 93 states and 127 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:42,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:42,062 INFO L93 Difference]: Finished difference Result 183 states and 251 transitions. [2025-01-09 16:08:42,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:08:42,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-01-09 16:08:42,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:42,064 INFO L225 Difference]: With dead ends: 183 [2025-01-09 16:08:42,064 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 16:08:42,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:42,065 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:42,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:08:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 16:08:42,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 16:08:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2025-01-09 16:08:42,077 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 96 [2025-01-09 16:08:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:42,077 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2025-01-09 16:08:42,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2025-01-09 16:08:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 16:08:42,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:42,079 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:42,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-01-09 16:08:42,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:42,287 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:42,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:42,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1760620992, now seen corresponding path program 1 times [2025-01-09 16:08:42,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:42,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018583972] [2025-01-09 16:08:42,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:42,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:42,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:42,290 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:08:42,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-01-09 16:08:42,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 16:08:42,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 16:08:42,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:42,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:42,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:08:42,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:42,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 16:08:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:42,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:42,742 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:42,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018583972] [2025-01-09 16:08:42,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018583972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:42,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:42,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:08:42,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554046841] [2025-01-09 16:08:42,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:42,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:08:42,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:42,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:08:42,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:42,743 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:43,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:43,055 INFO L93 Difference]: Finished difference Result 183 states and 249 transitions. [2025-01-09 16:08:43,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:08:43,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-01-09 16:08:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:43,058 INFO L225 Difference]: With dead ends: 183 [2025-01-09 16:08:43,058 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 16:08:43,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:43,059 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:43,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:08:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 16:08:43,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 16:08:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2025-01-09 16:08:43,070 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 125 transitions. Word has length 96 [2025-01-09 16:08:43,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:43,071 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 125 transitions. [2025-01-09 16:08:43,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:43,073 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2025-01-09 16:08:43,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 16:08:43,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:43,074 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:43,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2025-01-09 16:08:43,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:43,275 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:43,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:43,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1337919166, now seen corresponding path program 1 times [2025-01-09 16:08:43,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:43,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383917326] [2025-01-09 16:08:43,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:43,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:43,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:43,278 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:08:43,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-01-09 16:08:43,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 16:08:43,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 16:08:43,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:43,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:43,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:08:43,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:43,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 16:08:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:43,765 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:43,765 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:43,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383917326] [2025-01-09 16:08:43,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383917326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:43,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:43,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:08:43,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944813735] [2025-01-09 16:08:43,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:43,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:08:43,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:43,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:08:43,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:43,766 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:43,789 INFO L93 Difference]: Finished difference Result 183 states and 247 transitions. [2025-01-09 16:08:43,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:08:43,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-01-09 16:08:43,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:43,790 INFO L225 Difference]: With dead ends: 183 [2025-01-09 16:08:43,791 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 16:08:43,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:43,791 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:43,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 16:08:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 16:08:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 82 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2025-01-09 16:08:43,796 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 96 [2025-01-09 16:08:43,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:43,797 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2025-01-09 16:08:43,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:43,797 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2025-01-09 16:08:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 16:08:43,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:43,798 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:43,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-01-09 16:08:43,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:43,999 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:43,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:43,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1945930880, now seen corresponding path program 1 times [2025-01-09 16:08:44,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:44,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928011483] [2025-01-09 16:08:44,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:44,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:44,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:44,002 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:08:44,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-01-09 16:08:44,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 16:08:44,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 16:08:44,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:44,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:44,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:08:44,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:44,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2025-01-09 16:08:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:44,403 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:44,404 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:44,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928011483] [2025-01-09 16:08:44,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928011483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:44,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:44,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:08:44,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865886979] [2025-01-09 16:08:44,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:44,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:08:44,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:44,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:08:44,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:44,405 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:44,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:44,427 INFO L93 Difference]: Finished difference Result 181 states and 243 transitions. [2025-01-09 16:08:44,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:08:44,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-01-09 16:08:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:44,429 INFO L225 Difference]: With dead ends: 181 [2025-01-09 16:08:44,429 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 16:08:44,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:44,430 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:44,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 16:08:44,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 16:08:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 121 transitions. [2025-01-09 16:08:44,434 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 121 transitions. Word has length 96 [2025-01-09 16:08:44,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:44,434 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 121 transitions. [2025-01-09 16:08:44,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 121 transitions. [2025-01-09 16:08:44,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 16:08:44,436 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:44,436 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:44,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2025-01-09 16:08:44,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:44,637 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:44,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:44,637 INFO L85 PathProgramCache]: Analyzing trace with hash 182949049, now seen corresponding path program 1 times [2025-01-09 16:08:44,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:44,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478137855] [2025-01-09 16:08:44,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:44,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:44,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:44,639 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:08:44,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-01-09 16:08:44,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:08:45,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:08:45,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:45,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:45,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 16:08:45,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:45,353 INFO L349 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2025-01-09 16:08:45,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2025-01-09 16:08:45,928 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-01-09 16:08:45,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 36 [2025-01-09 16:08:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:46,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:46,322 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:46,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478137855] [2025-01-09 16:08:46,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478137855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:46,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:46,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 16:08:46,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760067516] [2025-01-09 16:08:46,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:46,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 16:08:46,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:46,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 16:08:46,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:08:46,324 INFO L87 Difference]: Start difference. First operand 91 states and 121 transitions. Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:51,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:08:54,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:54,974 INFO L93 Difference]: Finished difference Result 234 states and 313 transitions. [2025-01-09 16:08:54,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 16:08:54,975 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-01-09 16:08:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:54,976 INFO L225 Difference]: With dead ends: 234 [2025-01-09 16:08:54,976 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 16:08:54,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2025-01-09 16:08:54,977 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 72 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:54,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 884 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2025-01-09 16:08:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 16:08:54,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 105. [2025-01-09 16:08:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.297872340425532) internal successors, (122), 94 states have internal predecessors, (122), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 140 transitions. [2025-01-09 16:08:54,983 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 140 transitions. Word has length 101 [2025-01-09 16:08:54,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:54,984 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 140 transitions. [2025-01-09 16:08:54,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 140 transitions. [2025-01-09 16:08:54,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 16:08:54,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:54,985 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:55,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-01-09 16:08:55,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:55,186 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:55,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:55,186 INFO L85 PathProgramCache]: Analyzing trace with hash 884013627, now seen corresponding path program 1 times [2025-01-09 16:08:55,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:55,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273818667] [2025-01-09 16:08:55,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:55,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:55,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:55,189 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:08:55,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-01-09 16:08:55,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:08:55,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:08:55,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:55,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:55,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:08:55,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:55,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 16:08:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:55,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:55,573 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:55,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273818667] [2025-01-09 16:08:55,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273818667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:55,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:55,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:08:55,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797503133] [2025-01-09 16:08:55,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:55,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:08:55,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:55,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:08:55,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:55,575 INFO L87 Difference]: Start difference. First operand 105 states and 140 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:55,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:55,600 INFO L93 Difference]: Finished difference Result 199 states and 266 transitions. [2025-01-09 16:08:55,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:08:55,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-01-09 16:08:55,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:55,602 INFO L225 Difference]: With dead ends: 199 [2025-01-09 16:08:55,602 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 16:08:55,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:55,603 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:55,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:55,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 16:08:55,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2025-01-09 16:08:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.275) internal successors, (102), 80 states have internal predecessors, (102), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:08:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2025-01-09 16:08:55,607 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 101 [2025-01-09 16:08:55,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:55,607 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2025-01-09 16:08:55,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2025-01-09 16:08:55,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 16:08:55,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:55,608 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:55,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-01-09 16:08:55,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:55,812 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:55,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:55,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1505994693, now seen corresponding path program 1 times [2025-01-09 16:08:55,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:55,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598034231] [2025-01-09 16:08:55,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:55,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:55,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:55,816 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:08:55,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-01-09 16:08:55,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:08:56,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:08:56,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:56,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:56,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 16:08:56,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:56,380 INFO L349 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2025-01-09 16:08:56,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2025-01-09 16:08:56,922 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-01-09 16:08:56,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 36 [2025-01-09 16:08:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:57,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:57,319 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:57,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598034231] [2025-01-09 16:08:57,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598034231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:57,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:57,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 16:08:57,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69527426] [2025-01-09 16:08:57,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:57,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 16:08:57,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:57,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 16:08:57,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:08:57,320 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:01,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:09:06,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:09:06,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:06,363 INFO L93 Difference]: Finished difference Result 232 states and 307 transitions. [2025-01-09 16:09:06,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 16:09:06,364 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-01-09 16:09:06,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:06,365 INFO L225 Difference]: With dead ends: 232 [2025-01-09 16:09:06,365 INFO L226 Difference]: Without dead ends: 144 [2025-01-09 16:09:06,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:09:06,366 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 84 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:06,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 835 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2025-01-09 16:09:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-01-09 16:09:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 105. [2025-01-09 16:09:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 94 states have internal predecessors, (120), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:09:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2025-01-09 16:09:06,373 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 101 [2025-01-09 16:09:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:06,374 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2025-01-09 16:09:06,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2025-01-09 16:09:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 16:09:06,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:06,376 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:09:06,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-01-09 16:09:06,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:09:06,577 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:06,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:06,577 INFO L85 PathProgramCache]: Analyzing trace with hash -804930115, now seen corresponding path program 1 times [2025-01-09 16:09:06,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:09:06,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54657437] [2025-01-09 16:09:06,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:06,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:09:06,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:09:06,580 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:09:06,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-01-09 16:09:06,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:09:06,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:09:06,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:06,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:06,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:09:06,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:09:06,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 16:09:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:06,996 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:09:06,996 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:09:06,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54657437] [2025-01-09 16:09:06,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54657437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:06,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:06,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:09:06,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498195390] [2025-01-09 16:09:06,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:06,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:09:06,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:09:06,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:09:06,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:09:06,998 INFO L87 Difference]: Start difference. First operand 105 states and 138 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:07,023 INFO L93 Difference]: Finished difference Result 201 states and 265 transitions. [2025-01-09 16:09:07,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:09:07,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-01-09 16:09:07,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:07,026 INFO L225 Difference]: With dead ends: 201 [2025-01-09 16:09:07,026 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 16:09:07,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:09:07,026 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:07,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:09:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 16:09:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2025-01-09 16:09:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.2625) internal successors, (101), 80 states have internal predecessors, (101), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:09:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 119 transitions. [2025-01-09 16:09:07,036 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 119 transitions. Word has length 101 [2025-01-09 16:09:07,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:07,037 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 119 transitions. [2025-01-09 16:09:07,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:07,037 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 119 transitions. [2025-01-09 16:09:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 16:09:07,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:07,040 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:09:07,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-01-09 16:09:07,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:09:07,241 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:07,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:07,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1200624701, now seen corresponding path program 1 times [2025-01-09 16:09:07,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:09:07,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848500594] [2025-01-09 16:09:07,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:07,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:09:07,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:09:07,246 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:09:07,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-01-09 16:09:07,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:09:07,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:09:07,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:07,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:07,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 16:09:07,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:09:07,926 INFO L349 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2025-01-09 16:09:07,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2025-01-09 16:09:08,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:09:08,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 84 [2025-01-09 16:09:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:08,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:09:08,817 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:09:08,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848500594] [2025-01-09 16:09:08,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848500594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:08,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:08,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 16:09:08,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413553432] [2025-01-09 16:09:08,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:08,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 16:09:08,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:09:08,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 16:09:08,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:09:08,819 INFO L87 Difference]: Start difference. First operand 91 states and 119 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:12,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:09:21,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:09:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:21,284 INFO L93 Difference]: Finished difference Result 227 states and 296 transitions. [2025-01-09 16:09:21,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 16:09:21,285 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-01-09 16:09:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:21,286 INFO L225 Difference]: With dead ends: 227 [2025-01-09 16:09:21,286 INFO L226 Difference]: Without dead ends: 139 [2025-01-09 16:09:21,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:09:21,287 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 59 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:21,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 886 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 710 Invalid, 1 Unknown, 0 Unchecked, 11.8s Time] [2025-01-09 16:09:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-09 16:09:21,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 105. [2025-01-09 16:09:21,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 94 states have internal predecessors, (118), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:09:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2025-01-09 16:09:21,293 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 101 [2025-01-09 16:09:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:21,293 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2025-01-09 16:09:21,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2025-01-09 16:09:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 16:09:21,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:21,294 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:09:21,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-01-09 16:09:21,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:09:21,495 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:21,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:21,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1901689279, now seen corresponding path program 1 times [2025-01-09 16:09:21,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:09:21,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772959937] [2025-01-09 16:09:21,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:21,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:09:21,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:09:21,498 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:09:21,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-01-09 16:09:21,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:09:21,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:09:21,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:21,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:21,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:09:21,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:09:21,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 16:09:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:21,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:09:21,960 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:09:21,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772959937] [2025-01-09 16:09:21,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772959937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:21,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:21,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:09:21,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58737273] [2025-01-09 16:09:21,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:21,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:09:21,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:09:21,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:09:21,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:09:21,961 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:21,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:21,980 INFO L93 Difference]: Finished difference Result 203 states and 265 transitions. [2025-01-09 16:09:21,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:09:21,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-01-09 16:09:21,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:21,982 INFO L225 Difference]: With dead ends: 203 [2025-01-09 16:09:21,982 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 16:09:21,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:09:21,983 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:21,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:09:21,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 16:09:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2025-01-09 16:09:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:09:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 118 transitions. [2025-01-09 16:09:21,990 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 118 transitions. Word has length 101 [2025-01-09 16:09:21,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:21,990 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 118 transitions. [2025-01-09 16:09:21,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2025-01-09 16:09:21,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 16:09:21,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:21,992 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:09:22,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2025-01-09 16:09:22,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:09:22,196 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:22,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:22,196 INFO L85 PathProgramCache]: Analyzing trace with hash -79238977, now seen corresponding path program 1 times [2025-01-09 16:09:22,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:09:22,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608814453] [2025-01-09 16:09:22,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:22,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:09:22,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:09:22,198 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:09:22,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2025-01-09 16:09:22,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:09:28,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:09:28,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:28,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:28,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 16:09:28,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:09:29,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 16:09:29,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 38 [2025-01-09 16:09:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:29,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:09:29,885 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:09:29,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608814453] [2025-01-09 16:09:29,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608814453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:29,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:29,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 16:09:29,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435464422] [2025-01-09 16:09:29,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:29,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 16:09:29,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:09:29,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 16:09:29,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:09:29,889 INFO L87 Difference]: Start difference. First operand 91 states and 118 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:32,792 INFO L93 Difference]: Finished difference Result 219 states and 284 transitions. [2025-01-09 16:09:32,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:09:32,793 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-01-09 16:09:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:32,794 INFO L225 Difference]: With dead ends: 219 [2025-01-09 16:09:32,794 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 16:09:32,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2025-01-09 16:09:32,796 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 211 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:32,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 319 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 16:09:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 16:09:32,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 100. [2025-01-09 16:09:32,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 89 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:09:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 128 transitions. [2025-01-09 16:09:32,802 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 128 transitions. Word has length 101 [2025-01-09 16:09:32,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:32,802 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 128 transitions. [2025-01-09 16:09:32,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:32,802 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 128 transitions. [2025-01-09 16:09:32,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 16:09:32,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:32,803 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:09:32,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2025-01-09 16:09:33,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:09:33,004 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:33,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:33,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1072460934, now seen corresponding path program 1 times [2025-01-09 16:09:33,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:09:33,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375834816] [2025-01-09 16:09:33,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:33,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:09:33,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:09:33,006 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:09:33,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-01-09 16:09:33,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:09:33,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:09:33,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:33,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:33,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:09:33,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:09:33,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 16:09:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:33,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:09:33,433 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:09:33,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375834816] [2025-01-09 16:09:33,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375834816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:33,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:33,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:09:33,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514541868] [2025-01-09 16:09:33,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:33,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:09:33,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:09:33,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:09:33,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:09:33,435 INFO L87 Difference]: Start difference. First operand 100 states and 128 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:33,458 INFO L93 Difference]: Finished difference Result 197 states and 253 transitions. [2025-01-09 16:09:33,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:09:33,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-01-09 16:09:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:33,459 INFO L225 Difference]: With dead ends: 197 [2025-01-09 16:09:33,460 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 16:09:33,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:09:33,461 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:33,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:09:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 16:09:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-01-09 16:09:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 89 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:09:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2025-01-09 16:09:33,467 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 101 [2025-01-09 16:09:33,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:33,467 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2025-01-09 16:09:33,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2025-01-09 16:09:33,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 16:09:33,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:33,469 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:09:33,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2025-01-09 16:09:33,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:09:33,670 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:33,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash -207402744, now seen corresponding path program 1 times [2025-01-09 16:09:33,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:09:33,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884284901] [2025-01-09 16:09:33,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:33,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:09:33,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:09:33,673 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:09:33,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2025-01-09 16:09:33,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:09:34,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:09:34,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:34,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:34,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 16:09:34,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:09:36,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-01-09 16:09:37,019 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-01-09 16:09:37,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2025-01-09 16:09:37,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2025-01-09 16:09:37,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 47