./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-80.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 2f49db024cf89bfd4f79528ea90efdc9ebcf8b7a9e599658c336eeffe7b60010 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:25:50,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:25:50,291 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:25:50,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:25:50,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:25:50,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:25:50,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:25:50,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:25:50,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:25:50,311 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:25:50,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:25:50,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:25:50,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:25:50,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:25:50,311 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:25:50,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:25:50,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:25:50,313 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:25:50,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:25:50,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:25:50,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:25:50,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:25:50,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:25:50,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:25:50,314 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:25:50,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:25:50,314 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:25:50,314 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:25:50,314 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:25:50,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:25:50,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:25:50,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:25:50,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:25:50,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:25:50,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:25:50,315 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:25:50,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:25:50,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:25:50,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:25:50,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:25:50,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:25:50,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:25:50,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:25:50,316 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 -> 2f49db024cf89bfd4f79528ea90efdc9ebcf8b7a9e599658c336eeffe7b60010 [2025-03-08 14:25:50,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:25:50,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:25:50,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:25:50,577 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:25:50,577 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:25:50,578 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-80.i [2025-03-08 14:25:51,835 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de2b6f20f/052c94305634490f8f0117aec21b5aa6/FLAG626d38fae [2025-03-08 14:25:52,050 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:25:52,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-80.i [2025-03-08 14:25:52,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de2b6f20f/052c94305634490f8f0117aec21b5aa6/FLAG626d38fae [2025-03-08 14:25:52,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de2b6f20f/052c94305634490f8f0117aec21b5aa6 [2025-03-08 14:25:52,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:25:52,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:25:52,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:25:52,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:25:52,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:25:52,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:25:52" (1/1) ... [2025-03-08 14:25:52,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261c242d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:52, skipping insertion in model container [2025-03-08 14:25:52,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:25:52" (1/1) ... [2025-03-08 14:25:52,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:25:52,240 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-80.i[915,928] [2025-03-08 14:25:52,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:25:52,286 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:25:52,294 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-80.i[915,928] [2025-03-08 14:25:52,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:25:52,333 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:25:52,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:52 WrapperNode [2025-03-08 14:25:52,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:25:52,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:25:52,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:25:52,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:25:52,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:52" (1/1) ... [2025-03-08 14:25:52,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:52" (1/1) ... [2025-03-08 14:25:52,365 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2025-03-08 14:25:52,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:25:52,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:25:52,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:25:52,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:25:52,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:52" (1/1) ... [2025-03-08 14:25:52,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:52" (1/1) ... [2025-03-08 14:25:52,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:52" (1/1) ... [2025-03-08 14:25:52,397 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-08 14:25:52,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:52" (1/1) ... [2025-03-08 14:25:52,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:52" (1/1) ... [2025-03-08 14:25:52,401 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:52" (1/1) ... [2025-03-08 14:25:52,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:52" (1/1) ... [2025-03-08 14:25:52,406 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:52" (1/1) ... [2025-03-08 14:25:52,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:52" (1/1) ... [2025-03-08 14:25:52,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:25:52,412 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:25:52,412 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:25:52,412 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:25:52,413 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:52" (1/1) ... [2025-03-08 14:25:52,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:25:52,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:25:52,446 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-08 14:25:52,448 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-08 14:25:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:25:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:25:52,467 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:25:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:25:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:25:52,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:25:52,529 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:25:52,531 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:25:52,695 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:25:52,696 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:25:52,708 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:25:52,708 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:25:52,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:25:52 BoogieIcfgContainer [2025-03-08 14:25:52,709 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:25:52,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:25:52,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:25:52,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:25:52,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:25:52" (1/3) ... [2025-03-08 14:25:52,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d283cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:25:52, skipping insertion in model container [2025-03-08 14:25:52,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:52" (2/3) ... [2025-03-08 14:25:52,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d283cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:25:52, skipping insertion in model container [2025-03-08 14:25:52,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:25:52" (3/3) ... [2025-03-08 14:25:52,715 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-80.i [2025-03-08 14:25:52,725 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:25:52,726 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-80.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:25:52,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:25:52,781 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;@49894497, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:25:52,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:25:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 14:25:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 14:25:52,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:25:52,792 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:25:52,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:25:52,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:25:52,797 INFO L85 PathProgramCache]: Analyzing trace with hash 422695043, now seen corresponding path program 1 times [2025-03-08 14:25:52,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:25:52,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850041194] [2025-03-08 14:25:52,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:25:52,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:25:52,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 14:25:52,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 14:25:52,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:25:52,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:25:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-08 14:25:53,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:25:53,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850041194] [2025-03-08 14:25:53,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850041194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:25:53,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622639803] [2025-03-08 14:25:53,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:25:53,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:25:53,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:25:53,051 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-08 14:25:53,052 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-08 14:25:53,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 14:25:53,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 14:25:53,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:25:53,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:25:53,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:25:53,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:25:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-08 14:25:53,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:25:53,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622639803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:25:53,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:25:53,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:25:53,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132354140] [2025-03-08 14:25:53,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:25:53,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:25:53,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:25:53,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:25:53,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:25:53,248 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 14:25:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:25:53,263 INFO L93 Difference]: Finished difference Result 115 states and 195 transitions. [2025-03-08 14:25:53,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:25:53,264 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2025-03-08 14:25:53,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:25:53,269 INFO L225 Difference]: With dead ends: 115 [2025-03-08 14:25:53,269 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 14:25:53,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 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-08 14:25:53,274 INFO L435 NwaCegarLoop]: 86 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, 86 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-08 14:25:53,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:25:53,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 14:25:53,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-08 14:25:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 14:25:53,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2025-03-08 14:25:53,317 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 135 [2025-03-08 14:25:53,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:25:53,317 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2025-03-08 14:25:53,317 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 14:25:53,317 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2025-03-08 14:25:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 14:25:53,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:25:53,320 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:25:53,327 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-08 14:25:53,521 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-08 14:25:53,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:25:53,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:25:53,522 INFO L85 PathProgramCache]: Analyzing trace with hash -609238335, now seen corresponding path program 1 times [2025-03-08 14:25:53,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:25:53,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885546837] [2025-03-08 14:25:53,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:25:53,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:25:53,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 14:25:53,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 14:25:53,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:25:53,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:25:53,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1285515736] [2025-03-08 14:25:53,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:25:53,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:25:53,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:25:53,626 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-08 14:25:53,627 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-08 14:25:53,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 14:25:53,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 14:25:53,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:25:53,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:25:53,724 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:25:53,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 14:25:53,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 14:25:53,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:25:53,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:25:53,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:25:53,811 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:25:53,812 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:25:53,821 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-08 14:25:54,014 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,SelfDestructingSolverStorable1 [2025-03-08 14:25:54,017 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 14:25:54,077 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:25:54,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:25:54 BoogieIcfgContainer [2025-03-08 14:25:54,079 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:25:54,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:25:54,080 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:25:54,080 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:25:54,080 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:25:52" (3/4) ... [2025-03-08 14:25:54,082 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:25:54,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:25:54,083 INFO L158 Benchmark]: Toolchain (without parser) took 1974.48ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 67.5MB in the end (delta: 38.9MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2025-03-08 14:25:54,083 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:25:54,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.92ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 93.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:25:54,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.17ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:25:54,084 INFO L158 Benchmark]: Boogie Preprocessor took 42.28ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:25:54,084 INFO L158 Benchmark]: IcfgBuilder took 296.54ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 74.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:25:54,084 INFO L158 Benchmark]: TraceAbstraction took 1368.76ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 68.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2025-03-08 14:25:54,085 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 142.6MB. Free memory was 68.3MB in the beginning and 67.5MB in the end (delta: 780.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:25:54,086 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.91ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.92ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 93.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.17ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.28ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 296.54ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 74.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1368.76ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 68.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 142.6MB. Free memory was 68.3MB in the beginning and 67.5MB in the end (delta: 780.6kB). 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 103, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 256; [L23] signed long int var_1_2 = -128; [L24] signed long int var_1_3 = 8; [L25] signed long int var_1_4 = 0; [L26] signed long int var_1_5 = 8; [L27] signed long int var_1_6 = 10; [L28] signed long int var_1_7 = 5; [L29] signed long int var_1_8 = 128; [L30] signed short int var_1_9 = 128; [L31] float var_1_10 = 64.4; [L32] float var_1_11 = 10.25; [L33] double var_1_12 = 63.175; [L34] unsigned char var_1_13 = 1; [L35] double var_1_14 = 128.5; [L36] double var_1_15 = 128.8; VAL [isInitial=0, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=-128, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L107] isInitial = 1 [L108] FCALL initially() [L109] int k_loop; [L110] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=-128, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L110] COND TRUE k_loop < 1 [L111] FCALL updateLastVariables() [L112] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_long() [L66] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L66] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L67] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L67] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L68] var_1_3 = __VERIFIER_nondet_long() [L69] CALL assume_abort_if_not(var_1_3 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L69] RET assume_abort_if_not(var_1_3 >= -1) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L70] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L70] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L71] var_1_4 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L73] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L73] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L74] var_1_5 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L75] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L76] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L76] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L77] var_1_6 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L78] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L79] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L79] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L80] var_1_7 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=128, var_1_9=128] [L81] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=128, var_1_9=128] [L82] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=128, var_1_9=128] [L82] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=128, var_1_9=128] [L83] var_1_8 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L84] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L85] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L85] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L86] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L86] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L87] var_1_9 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_9 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L88] RET assume_abort_if_not(var_1_9 >= -32767) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L89] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L89] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L90] var_1_11 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L91] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L92] var_1_13 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L93] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L94] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=-255, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=-255, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L94] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=-255, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L95] var_1_14 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=-255, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=-255, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L96] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=-255, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L97] var_1_15 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=-255, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=-255, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L98] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=-255, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L112] RET updateVariables() [L113] CALL step() [L40] COND TRUE (((((var_1_3 - var_1_4)) > (var_1_2)) ? ((var_1_3 - var_1_4)) : (var_1_2))) <= (((((var_1_5 - var_1_6)) < ((var_1_7 % var_1_8))) ? ((var_1_5 - var_1_6)) : ((var_1_7 % var_1_8)))) [L41] var_1_1 = var_1_9 VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=-255, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L43] COND FALSE !(var_1_8 > var_1_1) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=-255, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L48] signed long int stepLocal_1 = var_1_5; [L49] signed short int stepLocal_0 = var_1_1; VAL [isInitial=1, stepLocal_0=2, stepLocal_1=0, var_1_10=322/5, var_1_12=2527/40, var_1_13=-255, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L50] COND FALSE !(stepLocal_0 <= var_1_8) [L61] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_1=0, var_1_10=322/5, var_1_11=2, var_1_12=2, var_1_13=-255, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L113] RET step() [L114] CALL, EXPR property() [L103-L104] return ((((((((var_1_3 - var_1_4)) > (var_1_2)) ? ((var_1_3 - var_1_4)) : (var_1_2))) <= (((((var_1_5 - var_1_6)) < ((var_1_7 % var_1_8))) ? ((var_1_5 - var_1_6)) : ((var_1_7 % var_1_8))))) ? (var_1_1 == ((signed short int) var_1_9)) : 1) && ((var_1_8 > var_1_1) ? ((var_1_1 == var_1_4) ? (var_1_10 == ((float) var_1_11)) : 1) : 1)) && ((var_1_1 <= var_1_8) ? ((var_1_5 != -64) ? (var_1_13 ? (var_1_12 == ((double) ((((var_1_14 - var_1_15) < 0 ) ? -(var_1_14 - var_1_15) : (var_1_14 - var_1_15))))) : (var_1_12 == ((double) (var_1_15 - var_1_14)))) : (var_1_12 == ((double) 32.8))) : (var_1_12 == ((double) var_1_11))) ; VAL [\result=0, isInitial=1, var_1_10=322/5, var_1_11=2, var_1_12=2, var_1_13=-255, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=322/5, var_1_11=2, var_1_12=2, var_1_13=-255, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=322/5, var_1_11=2, var_1_12=2, var_1_13=-255, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 110 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 86 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 540 NumberOfCodeBlocks, 540 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 301 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1806/1848 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-08 14:25:54,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-80.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 2f49db024cf89bfd4f79528ea90efdc9ebcf8b7a9e599658c336eeffe7b60010 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:25:55,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:25:55,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:25:55,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:25:55,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:25:55,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:25:55,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:25:55,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:25:55,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:25:55,982 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:25:55,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:25:55,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:25:55,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:25:55,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:25:55,983 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:25:55,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:25:55,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:25:55,984 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:25:55,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:25:55,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:25:55,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:25:55,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:25:55,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:25:55,984 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:25:55,985 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:25:55,985 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:25:55,985 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:25:55,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:25:55,985 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:25:55,985 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:25:55,985 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:25:55,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:25:55,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:25:55,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:25:55,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:25:55,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:25:55,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:25:55,986 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:25:55,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:25:55,986 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:25:55,986 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:25:55,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:25:55,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:25:55,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:25:55,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:25:55,987 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 -> 2f49db024cf89bfd4f79528ea90efdc9ebcf8b7a9e599658c336eeffe7b60010 [2025-03-08 14:25:56,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:25:56,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:25:56,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:25:56,235 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:25:56,236 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:25:56,237 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-80.i [2025-03-08 14:25:57,443 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a671261f0/4d2d114f52f7415e884b73ae810cc72a/FLAG82ce44f3d [2025-03-08 14:25:57,639 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:25:57,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-80.i [2025-03-08 14:25:57,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a671261f0/4d2d114f52f7415e884b73ae810cc72a/FLAG82ce44f3d [2025-03-08 14:25:58,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a671261f0/4d2d114f52f7415e884b73ae810cc72a [2025-03-08 14:25:58,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:25:58,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:25:58,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:25:58,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:25:58,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:25:58,026 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:25:58" (1/1) ... [2025-03-08 14:25:58,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf2861d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:58, skipping insertion in model container [2025-03-08 14:25:58,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:25:58" (1/1) ... [2025-03-08 14:25:58,038 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:25:58,125 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-80.i[915,928] [2025-03-08 14:25:58,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:25:58,173 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:25:58,180 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-80.i[915,928] [2025-03-08 14:25:58,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:25:58,209 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:25:58,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:58 WrapperNode [2025-03-08 14:25:58,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:25:58,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:25:58,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:25:58,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:25:58,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:58" (1/1) ... [2025-03-08 14:25:58,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:58" (1/1) ... [2025-03-08 14:25:58,243 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-03-08 14:25:58,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:25:58,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:25:58,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:25:58,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:25:58,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:58" (1/1) ... [2025-03-08 14:25:58,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:58" (1/1) ... [2025-03-08 14:25:58,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:58" (1/1) ... [2025-03-08 14:25:58,269 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-08 14:25:58,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:58" (1/1) ... [2025-03-08 14:25:58,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:58" (1/1) ... [2025-03-08 14:25:58,281 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:58" (1/1) ... [2025-03-08 14:25:58,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:58" (1/1) ... [2025-03-08 14:25:58,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:58" (1/1) ... [2025-03-08 14:25:58,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:58" (1/1) ... [2025-03-08 14:25:58,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:25:58,289 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:25:58,290 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:25:58,290 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:25:58,290 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:58" (1/1) ... [2025-03-08 14:25:58,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:25:58,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:25:58,320 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-08 14:25:58,325 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-08 14:25:58,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:25:58,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:25:58,343 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:25:58,343 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:25:58,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:25:58,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:25:58,413 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:25:58,414 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:26:00,145 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:26:00,145 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:26:00,153 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:26:00,153 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:26:00,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:26:00 BoogieIcfgContainer [2025-03-08 14:26:00,153 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:26:00,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:26:00,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:26:00,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:26:00,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:25:58" (1/3) ... [2025-03-08 14:26:00,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98eb908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:26:00, skipping insertion in model container [2025-03-08 14:26:00,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:25:58" (2/3) ... [2025-03-08 14:26:00,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98eb908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:26:00, skipping insertion in model container [2025-03-08 14:26:00,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:26:00" (3/3) ... [2025-03-08 14:26:00,161 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-80.i [2025-03-08 14:26:00,172 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:26:00,173 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-80.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:26:00,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:26:00,229 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;@4cd4a509, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:26:00,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:26:00,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 14:26:00,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 14:26:00,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:26:00,246 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:26:00,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:26:00,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:26:00,250 INFO L85 PathProgramCache]: Analyzing trace with hash 422695043, now seen corresponding path program 1 times [2025-03-08 14:26:00,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:26:00,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882485010] [2025-03-08 14:26:00,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:26:00,258 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-08 14:26:00,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:26:00,260 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-08 14:26:00,261 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-08 14:26:00,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 14:26:00,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 14:26:00,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:26:00,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:26:00,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:26:00,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:26:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 14:26:00,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:26:00,582 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:26:00,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882485010] [2025-03-08 14:26:00,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882485010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:26:00,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:26:00,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:26:00,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080248526] [2025-03-08 14:26:00,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:26:00,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:26:00,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:26:00,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:26:00,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:26:00,621 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 14:26:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:26:00,647 INFO L93 Difference]: Finished difference Result 115 states and 195 transitions. [2025-03-08 14:26:00,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:26:00,648 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2025-03-08 14:26:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:26:00,654 INFO L225 Difference]: With dead ends: 115 [2025-03-08 14:26:00,654 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 14:26:00,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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-08 14:26:00,660 INFO L435 NwaCegarLoop]: 86 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, 86 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-08 14:26:00,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:26:00,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 14:26:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-08 14:26:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 14:26:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2025-03-08 14:26:00,698 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 135 [2025-03-08 14:26:00,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:26:00,698 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2025-03-08 14:26:00,699 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 14:26:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2025-03-08 14:26:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 14:26:00,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:26:00,702 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:26:00,716 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-08 14:26:00,902 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-08 14:26:00,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:26:00,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:26:00,904 INFO L85 PathProgramCache]: Analyzing trace with hash -609238335, now seen corresponding path program 1 times [2025-03-08 14:26:00,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:26:00,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843204694] [2025-03-08 14:26:00,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:26:00,904 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-08 14:26:00,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:26:00,909 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-08 14:26:00,910 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-08 14:26:00,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 14:26:01,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 14:26:01,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:26:01,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:26:01,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 14:26:01,214 INFO L279 TraceCheckSpWp]: Computing forward predicates...