./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-17.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_operatoramount_amount50_file-17.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 2980b9136e59113496e6d13bb8e78215f79122648c1e75cbc03475e7ce57761b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:53:41,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:53:41,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:53:41,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:53:41,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:53:41,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:53:41,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:53:41,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:53:41,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:53:41,146 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:53:41,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:53:41,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:53:41,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:53:41,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:53:41,148 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:53:41,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:53:41,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:53:41,149 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:53:41,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:53:41,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:53:41,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:53:41,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:53:41,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:53:41,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:53:41,150 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:53:41,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:53:41,150 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:53:41,150 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:53:41,150 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:53:41,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:53:41,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:53:41,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:53:41,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:53:41,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:53:41,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:53:41,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:53:41,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:53:41,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:53:41,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:53:41,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:53:41,152 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:53:41,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:53:41,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:53:41,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:53:41,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:53:41,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:53:41,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:53:41,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:53:41,153 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 -> 2980b9136e59113496e6d13bb8e78215f79122648c1e75cbc03475e7ce57761b [2025-01-09 14:53:41,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:53:41,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:53:41,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:53:41,455 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:53:41,456 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:53:41,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-17.i [2025-01-09 14:53:42,697 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6737faf9/15eed8720ca94e7d84fc4353f2688bc0/FLAGec6a967fc [2025-01-09 14:53:42,997 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:53:42,997 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-17.i [2025-01-09 14:53:43,030 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6737faf9/15eed8720ca94e7d84fc4353f2688bc0/FLAGec6a967fc [2025-01-09 14:53:43,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6737faf9/15eed8720ca94e7d84fc4353f2688bc0 [2025-01-09 14:53:43,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:53:43,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:53:43,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:53:43,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:53:43,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:53:43,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:53:43" (1/1) ... [2025-01-09 14:53:43,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b8ba04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:43, skipping insertion in model container [2025-01-09 14:53:43,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:53:43" (1/1) ... [2025-01-09 14:53:43,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:53:43,206 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_operatoramount_amount50_file-17.i[915,928] [2025-01-09 14:53:43,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:53:43,294 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:53:43,305 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_operatoramount_amount50_file-17.i[915,928] [2025-01-09 14:53:43,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:53:43,360 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:53:43,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:43 WrapperNode [2025-01-09 14:53:43,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:53:43,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:53:43,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:53:43,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:53:43,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:43" (1/1) ... [2025-01-09 14:53:43,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:43" (1/1) ... [2025-01-09 14:53:43,407 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2025-01-09 14:53:43,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:53:43,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:53:43,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:53:43,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:53:43,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:43" (1/1) ... [2025-01-09 14:53:43,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:43" (1/1) ... [2025-01-09 14:53:43,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:43" (1/1) ... [2025-01-09 14:53:43,437 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:53:43,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:43" (1/1) ... [2025-01-09 14:53:43,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:43" (1/1) ... [2025-01-09 14:53:43,449 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:43" (1/1) ... [2025-01-09 14:53:43,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:43" (1/1) ... [2025-01-09 14:53:43,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:43" (1/1) ... [2025-01-09 14:53:43,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:43" (1/1) ... [2025-01-09 14:53:43,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:43" (1/1) ... [2025-01-09 14:53:43,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:53:43,470 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:53:43,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:53:43,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:53:43,471 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:43" (1/1) ... [2025-01-09 14:53:43,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:53:43,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:53:43,501 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 14:53:43,509 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 14:53:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:53:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:53:43,527 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:53:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:53:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:53:43,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:53:43,592 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:53:43,593 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:53:43,903 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 14:53:43,903 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:53:43,913 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:53:43,913 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:53:43,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:53:43 BoogieIcfgContainer [2025-01-09 14:53:43,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:53:43,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:53:43,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:53:43,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:53:43,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:53:43" (1/3) ... [2025-01-09 14:53:43,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf400b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:53:43, skipping insertion in model container [2025-01-09 14:53:43,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:43" (2/3) ... [2025-01-09 14:53:43,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf400b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:53:43, skipping insertion in model container [2025-01-09 14:53:43,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:53:43" (3/3) ... [2025-01-09 14:53:43,920 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-17.i [2025-01-09 14:53:43,931 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:53:43,932 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-17.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:53:43,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:53:43,999 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;@2f6c9b01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:53:43,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:53:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 53 states have internal predecessors, (73), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 14:53:44,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 14:53:44,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:44,015 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:44,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:44,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:44,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1750779510, now seen corresponding path program 1 times [2025-01-09 14:53:44,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:44,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105030756] [2025-01-09 14:53:44,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:44,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:44,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 14:53:44,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 14:53:44,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:44,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 14:53:44,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:44,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105030756] [2025-01-09 14:53:44,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105030756] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:53:44,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224029740] [2025-01-09 14:53:44,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:44,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:53:44,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:53:44,319 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 14:53:44,321 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 14:53:44,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 14:53:44,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 14:53:44,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:44,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:44,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:53:44,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:53:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 14:53:44,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:53:44,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224029740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:44,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:53:44,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:53:44,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955482858] [2025-01-09 14:53:44,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:44,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:53:44,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:44,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:53:44,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:53:44,550 INFO L87 Difference]: Start difference. First operand has 73 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 53 states have internal predecessors, (73), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 14:53:44,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:44,573 INFO L93 Difference]: Finished difference Result 140 states and 231 transitions. [2025-01-09 14:53:44,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:53:44,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 122 [2025-01-09 14:53:44,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:44,582 INFO L225 Difference]: With dead ends: 140 [2025-01-09 14:53:44,582 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 14:53:44,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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 14:53:44,588 INFO L435 NwaCegarLoop]: 104 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, 104 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 14:53:44,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:53:44,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 14:53:44,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-09 14:53:44,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 14:53:44,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 104 transitions. [2025-01-09 14:53:44,626 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 104 transitions. Word has length 122 [2025-01-09 14:53:44,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:44,627 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 104 transitions. [2025-01-09 14:53:44,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 14:53:44,627 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 104 transitions. [2025-01-09 14:53:44,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 14:53:44,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:44,630 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:44,639 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 14:53:44,831 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 14:53:44,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:44,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash -215238662, now seen corresponding path program 1 times [2025-01-09 14:53:44,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:44,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357617994] [2025-01-09 14:53:44,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:44,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:44,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 14:53:44,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 14:53:44,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:44,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 14:53:45,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:45,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357617994] [2025-01-09 14:53:45,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357617994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:45,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:45,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:53:45,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324407914] [2025-01-09 14:53:45,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:45,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:53:45,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:45,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:53:45,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:53:45,518 INFO L87 Difference]: Start difference. First operand 70 states and 104 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 14:53:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:45,723 INFO L93 Difference]: Finished difference Result 205 states and 307 transitions. [2025-01-09 14:53:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:53:45,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 122 [2025-01-09 14:53:45,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:45,726 INFO L225 Difference]: With dead ends: 205 [2025-01-09 14:53:45,726 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 14:53:45,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:53:45,727 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 70 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:45,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 343 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:53:45,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 14:53:45,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2025-01-09 14:53:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 14:53:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 157 transitions. [2025-01-09 14:53:45,757 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 157 transitions. Word has length 122 [2025-01-09 14:53:45,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:45,758 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 157 transitions. [2025-01-09 14:53:45,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 14:53:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 157 transitions. [2025-01-09 14:53:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 14:53:45,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:45,762 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:45,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:53:45,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:45,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:45,764 INFO L85 PathProgramCache]: Analyzing trace with hash 89691075, now seen corresponding path program 1 times [2025-01-09 14:53:45,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:45,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872134888] [2025-01-09 14:53:45,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:45,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:45,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 14:53:45,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 14:53:45,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:45,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:53:45,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1525768637] [2025-01-09 14:53:45,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:45,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:53:45,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:53:45,938 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 14:53:45,940 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 14:53:46,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 14:53:46,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 14:53:46,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:46,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:53:46,053 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:53:46,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 14:53:46,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 14:53:46,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:46,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:53:46,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:53:46,196 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:53:46,197 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:53:46,206 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 14:53:46,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:53:46,402 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 14:53:46,498 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:53:46,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:53:46 BoogieIcfgContainer [2025-01-09 14:53:46,502 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:53:46,503 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:53:46,503 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:53:46,504 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:53:46,504 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:53:43" (3/4) ... [2025-01-09 14:53:46,506 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:53:46,507 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:53:46,508 INFO L158 Benchmark]: Toolchain (without parser) took 3448.39ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 73.4MB in the end (delta: 33.1MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2025-01-09 14:53:46,508 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:53:46,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.98ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 91.6MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:53:46,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.13ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:53:46,510 INFO L158 Benchmark]: Boogie Preprocessor took 60.87ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 84.1MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:53:46,510 INFO L158 Benchmark]: RCFGBuilder took 443.59ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 61.0MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:53:46,510 INFO L158 Benchmark]: TraceAbstraction took 2587.05ms. Allocated memory is still 142.6MB. Free memory was 60.1MB in the beginning and 73.5MB in the end (delta: -13.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:53:46,510 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 73.4MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:53:46,512 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.15ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.98ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 91.6MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.13ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.87ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 84.1MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 443.59ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 61.0MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2587.05ms. Allocated memory is still 142.6MB. Free memory was 60.1MB in the beginning and 73.5MB in the end (delta: -13.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 73.4MB in the end (delta: 24.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 someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 25; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 7.3; [L32] double var_1_12 = 1.25; [L33] double var_1_13 = 128.8; [L34] signed char var_1_14 = -1; [L35] signed char var_1_15 = 10; [L36] signed short int var_1_16 = 8; [L37] unsigned long int var_1_18 = 128; [L38] unsigned long int var_1_19 = 3963666122; [L39] unsigned char last_1_var_1_8 = 1; [L40] signed char last_1_var_1_14 = -1; VAL [isInitial=0, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L125] isInitial = 1 [L126] FCALL initially() [L128] CALL updateLastVariables() [L117] last_1_var_1_8 = var_1_8 [L118] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L128] RET updateLastVariables() [L129] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L89] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L90] var_1_3 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L92] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L93] var_1_4 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L95] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L96] var_1_7 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L98] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L98] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L99] var_1_9 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L100] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L101] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L102] var_1_10 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L103] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L104] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L104] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L105] var_1_12 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L106] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L107] var_1_13 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L108] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L109] var_1_15 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_15 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L110] RET assume_abort_if_not(var_1_15 >= -127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L111] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L111] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L112] var_1_19 = __VERIFIER_nondet_ulong() [L113] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L113] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L114] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L114] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L129] RET updateVariables() [L130] CALL step() [L44] unsigned char stepLocal_0 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_0=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L45] COND TRUE stepLocal_0 && last_1_var_1_8 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L46] COND TRUE \read(last_1_var_1_8) [L47] var_1_5 = (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L52] COND TRUE var_1_5 < var_1_3 [L53] var_1_8 = ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L57] var_1_1 = (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L58] COND FALSE !((64.4f + 1.5f) <= var_1_13) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L63] unsigned char stepLocal_3 = var_1_9 && var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_3=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L64] COND TRUE stepLocal_3 || (var_1_8 && var_1_10) [L65] var_1_18 = (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483654, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L69] signed long int stepLocal_1 = 8 + var_1_14; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_1=7, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483654, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L70] COND TRUE var_1_4 == stepLocal_1 [L71] var_1_11 = ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483654, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L73] EXPR var_1_15 & var_1_1 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483654, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L73] unsigned long int stepLocal_2 = var_1_18 * (var_1_15 & var_1_1); [L74] COND FALSE !(var_1_12 >= 9.6) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483654, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR (((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483654, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L121-L122] return ((((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1)) && (((var_1_9 && var_1_8) || (var_1_8 && var_1_10)) ? (var_1_18 == ((unsigned long int) (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))))) : (var_1_18 == ((unsigned long int) var_1_2))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483654, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483654, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 447 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 245 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 202 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=2, InterpolantAutomatonStates: 7, 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, 2 MinimizatonAttempts, 32 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 612 NumberOfCodeBlocks, 612 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 363 ConstructedInterpolants, 0 QuantifiedInterpolants, 433 SizeOfPredicates, 0 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1802/1836 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 14:53:46,530 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_operatoramount_amount50_file-17.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 2980b9136e59113496e6d13bb8e78215f79122648c1e75cbc03475e7ce57761b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:53:48,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:53:48,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 14:53:48,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:53:48,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:53:48,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:53:48,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:53:48,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:53:48,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:53:48,906 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:53:48,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:53:48,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:53:48,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:53:48,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:53:48,907 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:53:48,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:53:48,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:53:48,907 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:53:48,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:53:48,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:53:48,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:53:48,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:53:48,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:53:48,907 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:53:48,907 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:53:48,908 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:53:48,908 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:53:48,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:53:48,908 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:53:48,908 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:53:48,908 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:53:48,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:53:48,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:53:48,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:53:48,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:53:48,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:53:48,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:53:48,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:53:48,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:53:48,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:53:48,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:53:48,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:53:48,909 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:53:48,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:53:48,909 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:53:48,909 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:53:48,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:53:48,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:53:48,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:53:48,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:53:48,912 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 -> 2980b9136e59113496e6d13bb8e78215f79122648c1e75cbc03475e7ce57761b [2025-01-09 14:53:49,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:53:49,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:53:49,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:53:49,166 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:53:49,166 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:53:49,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-17.i [2025-01-09 14:53:50,443 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49fb1514a/8b137f8caa31400c93d5bdba176a93cc/FLAG9bb097d85 [2025-01-09 14:53:50,671 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:53:50,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-17.i [2025-01-09 14:53:50,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49fb1514a/8b137f8caa31400c93d5bdba176a93cc/FLAG9bb097d85 [2025-01-09 14:53:50,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49fb1514a/8b137f8caa31400c93d5bdba176a93cc [2025-01-09 14:53:50,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:53:50,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:53:50,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:53:50,704 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:53:50,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:53:50,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:53:50" (1/1) ... [2025-01-09 14:53:50,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac7cb69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:50, skipping insertion in model container [2025-01-09 14:53:50,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:53:50" (1/1) ... [2025-01-09 14:53:50,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:53:50,859 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_operatoramount_amount50_file-17.i[915,928] [2025-01-09 14:53:50,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:53:50,945 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:53:50,954 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_operatoramount_amount50_file-17.i[915,928] [2025-01-09 14:53:50,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:53:51,001 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:53:51,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:51 WrapperNode [2025-01-09 14:53:51,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:53:51,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:53:51,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:53:51,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:53:51,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:51" (1/1) ... [2025-01-09 14:53:51,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:51" (1/1) ... [2025-01-09 14:53:51,059 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2025-01-09 14:53:51,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:53:51,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:53:51,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:53:51,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:53:51,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:51" (1/1) ... [2025-01-09 14:53:51,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:51" (1/1) ... [2025-01-09 14:53:51,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:51" (1/1) ... [2025-01-09 14:53:51,089 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:53:51,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:51" (1/1) ... [2025-01-09 14:53:51,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:51" (1/1) ... [2025-01-09 14:53:51,104 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:51" (1/1) ... [2025-01-09 14:53:51,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:51" (1/1) ... [2025-01-09 14:53:51,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:51" (1/1) ... [2025-01-09 14:53:51,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:51" (1/1) ... [2025-01-09 14:53:51,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:51" (1/1) ... [2025-01-09 14:53:51,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:53:51,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:53:51,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:53:51,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:53:51,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:51" (1/1) ... [2025-01-09 14:53:51,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:53:51,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:53:51,157 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 14:53:51,164 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 14:53:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:53:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:53:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:53:51,184 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:53:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:53:51,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:53:51,261 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:53:51,263 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:53:51,780 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 14:53:51,780 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:53:51,788 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:53:51,788 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:53:51,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:53:51 BoogieIcfgContainer [2025-01-09 14:53:51,789 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:53:51,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:53:51,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:53:51,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:53:51,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:53:50" (1/3) ... [2025-01-09 14:53:51,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb7daee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:53:51, skipping insertion in model container [2025-01-09 14:53:51,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:51" (2/3) ... [2025-01-09 14:53:51,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb7daee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:53:51, skipping insertion in model container [2025-01-09 14:53:51,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:53:51" (3/3) ... [2025-01-09 14:53:51,800 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-17.i [2025-01-09 14:53:51,813 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:53:51,814 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-17.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:53:51,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:53:51,882 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;@4094ca53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:53:51,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:53:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 14:53:51,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 14:53:51,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:51,898 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:51,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:51,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:51,904 INFO L85 PathProgramCache]: Analyzing trace with hash 681366725, now seen corresponding path program 1 times [2025-01-09 14:53:51,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:53:51,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485086563] [2025-01-09 14:53:51,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:51,919 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 14:53:51,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:53:51,922 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 14:53:51,924 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 14:53:52,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:53:52,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:53:52,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:52,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:52,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:53:52,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:53:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-01-09 14:53:52,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:53:52,255 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:53:52,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485086563] [2025-01-09 14:53:52,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485086563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:52,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:52,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:53:52,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105868450] [2025-01-09 14:53:52,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:52,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:53:52,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:53:52,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:53:52,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:53:52,280 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 14:53:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:52,299 INFO L93 Difference]: Finished difference Result 114 states and 191 transitions. [2025-01-09 14:53:52,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:53:52,301 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2025-01-09 14:53:52,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:52,307 INFO L225 Difference]: With dead ends: 114 [2025-01-09 14:53:52,307 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 14:53:52,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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 14:53:52,314 INFO L435 NwaCegarLoop]: 84 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, 84 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 14:53:52,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:53:52,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 14:53:52,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-09 14:53:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 14:53:52,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2025-01-09 14:53:52,357 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 119 [2025-01-09 14:53:52,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:52,358 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-01-09 14:53:52,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 14:53:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2025-01-09 14:53:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 14:53:52,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:52,363 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:52,371 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 14:53:52,564 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 14:53:52,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:52,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:52,565 INFO L85 PathProgramCache]: Analyzing trace with hash 762900929, now seen corresponding path program 1 times [2025-01-09 14:53:52,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:53:52,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096878361] [2025-01-09 14:53:52,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:52,566 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 14:53:52,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:53:52,570 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 14:53:52,572 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 14:53:52,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:53:52,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:53:52,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:52,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:52,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 14:53:52,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:53:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 14:53:53,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:53:53,101 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:53:53,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096878361] [2025-01-09 14:53:53,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096878361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:53,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:53,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:53:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881713786] [2025-01-09 14:53:53,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:53,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:53:53,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:53:53,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:53:53,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:53:53,107 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 14:53:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:53,565 INFO L93 Difference]: Finished difference Result 166 states and 247 transitions. [2025-01-09 14:53:53,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:53:53,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 14:53:53,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:53,576 INFO L225 Difference]: With dead ends: 166 [2025-01-09 14:53:53,576 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 14:53:53,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:53:53,580 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 47 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:53,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 264 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:53:53,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 14:53:53,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2025-01-09 14:53:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 14:53:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2025-01-09 14:53:53,613 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 119 [2025-01-09 14:53:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:53,613 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2025-01-09 14:53:53,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 14:53:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2025-01-09 14:53:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 14:53:53,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:53,615 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:53,622 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 14:53:53,815 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 14:53:53,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:53,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash 888214368, now seen corresponding path program 1 times [2025-01-09 14:53:53,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:53:53,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038195255] [2025-01-09 14:53:53,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:53,818 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 14:53:53,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:53:53,820 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 14:53:53,821 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 14:53:53,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 14:53:53,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 14:53:53,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:53,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:53,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 14:53:53,983 INFO L279 TraceCheckSpWp]: Computing forward predicates...