./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 99789bff671c1bff838a649be3936d6a549d150e85cee8347f1efba817c85ade --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:15:52,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:15:52,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:15:52,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:15:52,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:15:52,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:15:52,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:15:52,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:15:52,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:15:52,476 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:15:52,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:15:52,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:15:52,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:15:52,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:15:52,477 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:15:52,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:15:52,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:15:52,478 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:15:52,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:15:52,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:15:52,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:15:52,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:15:52,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:15:52,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:15:52,479 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:15:52,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:15:52,479 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:15:52,479 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:15:52,479 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:15:52,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:15:52,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:15:52,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:15:52,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:52,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:15:52,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:15:52,480 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:15:52,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:15:52,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:15:52,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:15:52,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:15:52,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:15:52,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:15:52,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:15:52,480 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/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 -> 99789bff671c1bff838a649be3936d6a549d150e85cee8347f1efba817c85ade [2025-03-03 23:15:52,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:15:52,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:15:52,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:15:52,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:15:52,716 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:15:52,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i [2025-03-03 23:15:53,836 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/697836256/9092b224fcc448c5a293f682bb8bdbe0/FLAG7e2828904 [2025-03-03 23:15:54,052 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:15:54,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i [2025-03-03 23:15:54,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/697836256/9092b224fcc448c5a293f682bb8bdbe0/FLAG7e2828904 [2025-03-03 23:15:54,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/697836256/9092b224fcc448c5a293f682bb8bdbe0 [2025-03-03 23:15:54,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:15:54,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:15:54,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:54,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:15:54,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:15:54,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:54" (1/1) ... [2025-03-03 23:15:54,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4596bcce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:54, skipping insertion in model container [2025-03-03 23:15:54,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:54" (1/1) ... [2025-03-03 23:15:54,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:15:54,217 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i[915,928] [2025-03-03 23:15:54,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:54,268 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:15:54,276 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i[915,928] [2025-03-03 23:15:54,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:54,308 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:15:54,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:54 WrapperNode [2025-03-03 23:15:54,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:54,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:54,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:15:54,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:15:54,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:54" (1/1) ... [2025-03-03 23:15:54,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:54" (1/1) ... [2025-03-03 23:15:54,339 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2025-03-03 23:15:54,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:54,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:15:54,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:15:54,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:15:54,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:54" (1/1) ... [2025-03-03 23:15:54,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:54" (1/1) ... [2025-03-03 23:15:54,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:54" (1/1) ... [2025-03-03 23:15:54,356 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-03-03 23:15:54,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:54" (1/1) ... [2025-03-03 23:15:54,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:54" (1/1) ... [2025-03-03 23:15:54,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:54" (1/1) ... [2025-03-03 23:15:54,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:54" (1/1) ... [2025-03-03 23:15:54,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:54" (1/1) ... [2025-03-03 23:15:54,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:54" (1/1) ... [2025-03-03 23:15:54,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:15:54,367 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:15:54,367 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:15:54,367 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:15:54,368 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:54" (1/1) ... [2025-03-03 23:15:54,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:54,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:54,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:15:54,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:15:54,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:15:54,410 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:15:54,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:15:54,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:15:54,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:15:54,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:15:54,466 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:15:54,467 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:15:54,659 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 23:15:54,659 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:15:54,669 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:15:54,669 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:15:54,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:54 BoogieIcfgContainer [2025-03-03 23:15:54,670 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:15:54,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:15:54,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:15:54,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:15:54,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:15:54" (1/3) ... [2025-03-03 23:15:54,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7cd979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:54, skipping insertion in model container [2025-03-03 23:15:54,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:54" (2/3) ... [2025-03-03 23:15:54,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7cd979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:54, skipping insertion in model container [2025-03-03 23:15:54,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:54" (3/3) ... [2025-03-03 23:15:54,679 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-96.i [2025-03-03 23:15:54,689 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:15:54,691 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-96.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:15:54,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:15:54,744 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;@37bd8793, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:15:54,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:15:54,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:15:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 23:15:54,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:54,754 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:15:54,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:54,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:54,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1572048080, now seen corresponding path program 1 times [2025-03-03 23:15:54,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:54,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218116234] [2025-03-03 23:15:54,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:54,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:54,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 23:15:54,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 23:15:54,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:54,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-03 23:15:54,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:15:54,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218116234] [2025-03-03 23:15:54,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218116234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:15:54,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070995696] [2025-03-03 23:15:54,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:54,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:15:54,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:54,983 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:15:54,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:15:55,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 23:15:55,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 23:15:55,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:55,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:55,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:15:55,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:55,134 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-03 23:15:55,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:15:55,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070995696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:55,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:15:55,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:15:55,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090999576] [2025-03-03 23:15:55,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:55,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:15:55,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:15:55,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:15:55,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:15:55,156 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 23:15:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:55,176 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2025-03-03 23:15:55,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:15:55,178 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 130 [2025-03-03 23:15:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:55,183 INFO L225 Difference]: With dead ends: 113 [2025-03-03 23:15:55,184 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 23:15:55,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-03-03 23:15:55,190 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-03-03 23:15:55,192 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-03-03 23:15:55,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 23:15:55,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-03 23:15:55,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:15:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2025-03-03 23:15:55,224 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 130 [2025-03-03 23:15:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:55,225 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2025-03-03 23:15:55,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 23:15:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2025-03-03 23:15:55,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 23:15:55,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:55,228 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:15:55,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:15:55,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:15:55,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:55,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:55,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1489414067, now seen corresponding path program 1 times [2025-03-03 23:15:55,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:55,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9516429] [2025-03-03 23:15:55,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:55,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:55,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 23:15:55,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 23:15:55,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:55,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-03 23:15:55,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:15:55,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9516429] [2025-03-03 23:15:55,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9516429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:55,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:15:55,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:15:55,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030507561] [2025-03-03 23:15:55,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:55,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:15:55,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:15:55,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:15:55,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:15:55,773 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 23:15:55,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:55,816 INFO L93 Difference]: Finished difference Result 159 states and 237 transitions. [2025-03-03 23:15:55,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:15:55,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 130 [2025-03-03 23:15:55,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:55,820 INFO L225 Difference]: With dead ends: 159 [2025-03-03 23:15:55,820 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 23:15:55,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:15:55,821 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 38 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:55,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 147 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:15:55,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 23:15:55,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-03-03 23:15:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 23:15:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2025-03-03 23:15:55,840 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 130 [2025-03-03 23:15:55,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:55,841 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2025-03-03 23:15:55,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 23:15:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2025-03-03 23:15:55,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 23:15:55,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:55,842 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:15:55,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:15:55,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:55,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:55,843 INFO L85 PathProgramCache]: Analyzing trace with hash -601910386, now seen corresponding path program 1 times [2025-03-03 23:15:55,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:55,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336139430] [2025-03-03 23:15:55,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:55,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:55,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 23:15:55,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 23:15:55,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:55,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:15:55,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1428682045] [2025-03-03 23:15:55,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:55,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:15:55,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:55,924 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:15:55,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:15:55,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 23:15:56,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 23:15:56,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:56,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:15:56,039 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:15:56,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 23:15:56,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 23:15:56,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:56,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:15:56,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:15:56,132 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:15:56,133 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:15:56,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 23:15:56,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 23:15:56,339 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 23:15:56,420 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:15:56,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:15:56 BoogieIcfgContainer [2025-03-03 23:15:56,422 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:15:56,423 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:15:56,423 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:15:56,423 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:15:56,423 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:54" (3/4) ... [2025-03-03 23:15:56,425 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:15:56,426 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:15:56,426 INFO L158 Benchmark]: Toolchain (without parser) took 2328.55ms. Allocated memory is still 201.3MB. Free memory was 155.4MB in the beginning and 95.7MB in the end (delta: 59.6MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2025-03-03 23:15:56,427 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:56,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.27ms. Allocated memory is still 201.3MB. Free memory was 154.9MB in the beginning and 142.3MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:15:56,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.48ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 140.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:15:56,427 INFO L158 Benchmark]: Boogie Preprocessor took 26.96ms. Allocated memory is still 201.3MB. Free memory was 139.8MB in the beginning and 137.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:56,427 INFO L158 Benchmark]: IcfgBuilder took 302.89ms. Allocated memory is still 201.3MB. Free memory was 137.3MB in the beginning and 119.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:15:56,427 INFO L158 Benchmark]: TraceAbstraction took 1750.80ms. Allocated memory is still 201.3MB. Free memory was 119.3MB in the beginning and 95.8MB in the end (delta: 23.5MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2025-03-03 23:15:56,427 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 201.3MB. Free memory was 95.8MB in the beginning and 95.7MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:56,428 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.37ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.27ms. Allocated memory is still 201.3MB. Free memory was 154.9MB in the beginning and 142.3MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.48ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 140.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.96ms. Allocated memory is still 201.3MB. Free memory was 139.8MB in the beginning and 137.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 302.89ms. Allocated memory is still 201.3MB. Free memory was 137.3MB in the beginning and 119.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1750.80ms. Allocated memory is still 201.3MB. Free memory was 119.3MB in the beginning and 95.8MB in the end (delta: 23.5MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 201.3MB. Free memory was 95.8MB in the beginning and 95.7MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryArithmeticFLOAToperation at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 8; [L25] unsigned short int var_1_4 = 1000; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 1; [L31] float var_1_10 = 0.125; [L32] signed long int var_1_11 = 50; [L33] float var_1_12 = 1000000000000.45; [L34] float var_1_13 = 128.5; [L35] float var_1_14 = 10000000.625; [L36] signed char var_1_15 = -5; [L37] signed char var_1_16 = 10; VAL [isInitial=0, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L110] isInitial = 1 [L111] FCALL initially() [L112] int k_loop; [L113] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L113] COND TRUE k_loop < 1 [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L70] var_1_2 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L71] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L72] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L72] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L73] var_1_3 = __VERIFIER_nondet_ushort() [L74] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L74] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L75] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L75] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L76] var_1_4 = __VERIFIER_nondet_ushort() [L77] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L77] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L78] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L78] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L79] var_1_6 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L81] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=1] [L81] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=1] [L82] var_1_7 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=1] [L83] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=1] [L84] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=1] [L85] var_1_8 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=1] [L86] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=1] [L87] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L88] var_1_9 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L89] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L90] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L91] var_1_11 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L92] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L93] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L94] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L95] var_1_12 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L96] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L97] var_1_13 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L98] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L99] var_1_16 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L100] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L101] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L115] RET updateVariables() [L116] CALL step() [L41] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L42] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, stepLocal_0=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L47] var_1_14 = var_1_12 [L48] var_1_15 = var_1_16 VAL [isInitial=1, stepLocal_0=1, var_1_10=1/8, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L49] COND FALSE !(! var_1_5) [L52] var_1_1 = var_1_4 VAL [isInitial=1, stepLocal_0=1, var_1_10=1/8, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L54] signed long int stepLocal_1 = -2 / var_1_11; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=1/8, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L55] COND TRUE stepLocal_1 > (((((var_1_4) > (var_1_3)) ? (var_1_4) : (var_1_3))) * var_1_1) [L56] var_1_10 = ((var_1_12 - var_1_13) + 9.8f) VAL [isInitial=1, stepLocal_0=1, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L116] RET step() [L117] CALL, EXPR property() [L106-L107] return (((((! var_1_5) ? (var_1_1 == ((unsigned short int) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((unsigned short int) var_1_4))) && (var_1_2 ? ((var_1_6 && (var_1_7 || var_1_8)) ? (var_1_5 == ((unsigned char) var_1_9)) : 1) : 1)) && (((-2 / var_1_11) > (((((var_1_4) > (var_1_3)) ? (var_1_4) : (var_1_3))) * var_1_1)) ? (var_1_10 == ((float) ((var_1_12 - var_1_13) + 9.8f))) : (var_1_5 ? (var_1_5 ? (var_1_10 == ((float) var_1_12)) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_12))))) && (var_1_14 == ((float) var_1_12))) && (var_1_15 == ((signed char) var_1_16)) ; VAL [\result=0, isInitial=1, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 161 mSDtfsCounter, 12 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 650 NumberOfCodeBlocks, 650 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 387 ConstructedInterpolants, 0 QuantifiedInterpolants, 465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 290 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2480/2520 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-03-03 23:15:56,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 99789bff671c1bff838a649be3936d6a549d150e85cee8347f1efba817c85ade --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:15:58,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:15:58,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:15:58,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:15:58,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:15:58,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:15:58,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:15:58,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:15:58,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:15:58,386 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:15:58,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:15:58,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:15:58,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:15:58,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:15:58,387 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:15:58,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:15:58,388 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:15:58,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:58,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:15:58,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:15:58,389 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:15:58,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:15:58,389 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:15:58,389 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:15:58,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:15:58,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:15:58,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:15:58,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:15:58,389 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/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 -> 99789bff671c1bff838a649be3936d6a549d150e85cee8347f1efba817c85ade [2025-03-03 23:15:58,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:15:58,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:15:58,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:15:58,618 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:15:58,618 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:15:58,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i [2025-03-03 23:15:59,794 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12078f2fa/5e5f223cf3664b0b82ca7831dd35fdb5/FLAG1fb222f75 [2025-03-03 23:15:59,986 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:15:59,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i [2025-03-03 23:15:59,994 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12078f2fa/5e5f223cf3664b0b82ca7831dd35fdb5/FLAG1fb222f75 [2025-03-03 23:16:00,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12078f2fa/5e5f223cf3664b0b82ca7831dd35fdb5 [2025-03-03 23:16:00,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:16:00,015 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:16:00,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:16:00,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:16:00,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:16:00,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:16:00" (1/1) ... [2025-03-03 23:16:00,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799fe5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:00, skipping insertion in model container [2025-03-03 23:16:00,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:16:00" (1/1) ... [2025-03-03 23:16:00,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:16:00,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i[915,928] [2025-03-03 23:16:00,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:16:00,205 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:16:00,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i[915,928] [2025-03-03 23:16:00,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:16:00,246 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:16:00,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:00 WrapperNode [2025-03-03 23:16:00,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:16:00,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:16:00,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:16:00,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:16:00,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:00" (1/1) ... [2025-03-03 23:16:00,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:00" (1/1) ... [2025-03-03 23:16:00,288 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-03-03 23:16:00,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:16:00,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:16:00,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:16:00,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:16:00,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:00" (1/1) ... [2025-03-03 23:16:00,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:00" (1/1) ... [2025-03-03 23:16:00,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:00" (1/1) ... [2025-03-03 23:16:00,311 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-03-03 23:16:00,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:00" (1/1) ... [2025-03-03 23:16:00,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:00" (1/1) ... [2025-03-03 23:16:00,320 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:00" (1/1) ... [2025-03-03 23:16:00,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:00" (1/1) ... [2025-03-03 23:16:00,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:00" (1/1) ... [2025-03-03 23:16:00,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:00" (1/1) ... [2025-03-03 23:16:00,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:16:00,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:16:00,327 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:16:00,327 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:16:00,328 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:00" (1/1) ... [2025-03-03 23:16:00,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:16:00,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:16:00,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:16:00,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:16:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:16:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:16:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:16:00,377 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:16:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:16:00,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:16:00,442 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:16:00,444 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:16:01,507 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 23:16:01,507 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:16:01,517 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:16:01,517 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:16:01,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:16:01 BoogieIcfgContainer [2025-03-03 23:16:01,518 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:16:01,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:16:01,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:16:01,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:16:01,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:16:00" (1/3) ... [2025-03-03 23:16:01,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c6f3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:16:01, skipping insertion in model container [2025-03-03 23:16:01,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:00" (2/3) ... [2025-03-03 23:16:01,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c6f3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:16:01, skipping insertion in model container [2025-03-03 23:16:01,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:16:01" (3/3) ... [2025-03-03 23:16:01,526 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-96.i [2025-03-03 23:16:01,537 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:16:01,538 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-96.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:16:01,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:16:01,594 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;@9896a71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:16:01,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:16:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:16:01,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 23:16:01,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:16:01,606 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:16:01,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:16:01,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:16:01,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1572048080, now seen corresponding path program 1 times [2025-03-03 23:16:01,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:16:01,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950338858] [2025-03-03 23:16:01,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:16:01,618 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-03-03 23:16:01,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:16:01,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-03 23:16:01,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:16:01,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 23:16:01,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 23:16:01,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:16:01,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:16:01,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:16:01,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:16:01,889 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2025-03-03 23:16:01,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:16:01,890 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:16:01,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950338858] [2025-03-03 23:16:01,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950338858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:16:01,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:16:01,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:16:01,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721480723] [2025-03-03 23:16:01,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:16:01,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:16:01,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:16:01,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:16:01,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:16:01,910 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 23:16:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:16:01,926 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2025-03-03 23:16:01,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:16:01,927 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 130 [2025-03-03 23:16:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:16:01,931 INFO L225 Difference]: With dead ends: 113 [2025-03-03 23:16:01,931 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 23:16:01,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-03-03 23:16:01,935 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-03-03 23:16:01,935 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-03-03 23:16:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 23:16:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-03 23:16:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:16:01,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2025-03-03 23:16:01,969 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 130 [2025-03-03 23:16:01,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:16:01,969 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2025-03-03 23:16:01,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 23:16:01,971 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2025-03-03 23:16:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 23:16:01,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:16:01,973 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:16:01,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:16:02,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-03 23:16:02,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:16:02,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:16:02,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1489414067, now seen corresponding path program 1 times [2025-03-03 23:16:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:16:02,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303411880] [2025-03-03 23:16:02,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:16:02,176 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-03-03 23:16:02,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:16:02,182 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-03 23:16:02,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:16:02,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 23:16:02,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 23:16:02,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:16:02,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:16:02,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 23:16:02,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:16:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-03 23:16:02,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:16:02,699 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:16:02,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303411880] [2025-03-03 23:16:02,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303411880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:16:02,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:16:02,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:16:02,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315343445] [2025-03-03 23:16:02,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:16:02,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:16:02,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:16:02,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:16:02,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:16:02,702 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 23:16:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:16:03,669 INFO L93 Difference]: Finished difference Result 159 states and 237 transitions. [2025-03-03 23:16:03,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:16:03,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 130 [2025-03-03 23:16:03,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:16:03,672 INFO L225 Difference]: With dead ends: 159 [2025-03-03 23:16:03,672 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 23:16:03,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:16:03,673 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 14 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:16:03,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 147 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 23:16:03,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 23:16:03,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-03-03 23:16:03,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 23:16:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2025-03-03 23:16:03,694 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 130 [2025-03-03 23:16:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:16:03,697 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2025-03-03 23:16:03,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 23:16:03,698 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2025-03-03 23:16:03,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 23:16:03,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:16:03,701 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:16:03,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:16:03,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-03 23:16:03,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:16:03,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:16:03,903 INFO L85 PathProgramCache]: Analyzing trace with hash -601910386, now seen corresponding path program 1 times [2025-03-03 23:16:03,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:16:03,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232538815] [2025-03-03 23:16:03,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:16:03,903 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-03-03 23:16:03,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:16:03,905 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-03 23:16:03,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:16:03,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 23:16:04,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 23:16:04,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:16:04,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:16:04,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 23:16:04,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:16:30,057 WARN L286 SmtUtils]: Spent 8.84s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)