./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_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 8e71cde4c3ce759247922c8d73cd0482952aedbfd0a1826f55f8bb77593825aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:25:14,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:25:14,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:25:14,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:25:14,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:25:14,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:25:14,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:25:14,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:25:14,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:25:14,706 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:25:14,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:25:14,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:25:14,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:25:14,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:25:14,707 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:25:14,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:25:14,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:25:14,709 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:25:14,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:25:14,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:25:14,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:25:14,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:25:14,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:25:14,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:25:14,709 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:25:14,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:25:14,709 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:25:14,709 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:25:14,709 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:25:14,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:25:14,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:25:14,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:25:14,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:25:14,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:25:14,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:25:14,710 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:25:14,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:25:14,710 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:25:14,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:25:14,710 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:25:14,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:25:14,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:25:14,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:25:14,710 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 -> 8e71cde4c3ce759247922c8d73cd0482952aedbfd0a1826f55f8bb77593825aa [2025-03-03 23:25:14,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:25:14,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:25:14,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:25:14,959 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:25:14,960 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:25:14,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-80.i [2025-03-03 23:25:16,132 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fc77f47/3f13bac6b05c4af9a55b0af9f4b1180c/FLAG643e20aad [2025-03-03 23:25:16,418 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:25:16,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-80.i [2025-03-03 23:25:16,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fc77f47/3f13bac6b05c4af9a55b0af9f4b1180c/FLAG643e20aad [2025-03-03 23:25:16,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fc77f47/3f13bac6b05c4af9a55b0af9f4b1180c [2025-03-03 23:25:16,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:25:16,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:25:16,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:25:16,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:25:16,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:25:16,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:25:16" (1/1) ... [2025-03-03 23:25:16,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47254d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:16, skipping insertion in model container [2025-03-03 23:25:16,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:25:16" (1/1) ... [2025-03-03 23:25:16,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:25:16,569 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-while_file-80.i[915,928] [2025-03-03 23:25:16,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:25:16,615 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:25:16,621 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-while_file-80.i[915,928] [2025-03-03 23:25:16,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:25:16,643 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:25:16,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:16 WrapperNode [2025-03-03 23:25:16,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:25:16,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:25:16,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:25:16,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:25:16,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:16" (1/1) ... [2025-03-03 23:25:16,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:16" (1/1) ... [2025-03-03 23:25:16,672 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2025-03-03 23:25:16,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:25:16,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:25:16,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:25:16,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:25:16,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:16" (1/1) ... [2025-03-03 23:25:16,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:16" (1/1) ... [2025-03-03 23:25:16,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:16" (1/1) ... [2025-03-03 23:25:16,688 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:25:16,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:16" (1/1) ... [2025-03-03 23:25:16,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:16" (1/1) ... [2025-03-03 23:25:16,691 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:16" (1/1) ... [2025-03-03 23:25:16,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:16" (1/1) ... [2025-03-03 23:25:16,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:16" (1/1) ... [2025-03-03 23:25:16,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:16" (1/1) ... [2025-03-03 23:25:16,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:25:16,695 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:25:16,695 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:25:16,695 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:25:16,696 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:16" (1/1) ... [2025-03-03 23:25:16,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:25:16,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:25:16,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:25:16,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:25:16,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:25:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:25:16,742 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:25:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:25:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:25:16,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:25:16,791 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:25:16,792 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:25:17,005 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 23:25:17,005 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:25:17,016 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:25:17,017 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:25:17,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:25:17 BoogieIcfgContainer [2025-03-03 23:25:17,019 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:25:17,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:25:17,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:25:17,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:25:17,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:25:16" (1/3) ... [2025-03-03 23:25:17,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad53b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:25:17, skipping insertion in model container [2025-03-03 23:25:17,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:16" (2/3) ... [2025-03-03 23:25:17,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad53b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:25:17, skipping insertion in model container [2025-03-03 23:25:17,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:25:17" (3/3) ... [2025-03-03 23:25:17,029 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-80.i [2025-03-03 23:25:17,040 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:25:17,042 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-80.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:25:17,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:25:17,094 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;@69c33462, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:25:17,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:25:17,098 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-03 23:25:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 23:25:17,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:25:17,109 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-03 23:25:17,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:25:17,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:25:17,113 INFO L85 PathProgramCache]: Analyzing trace with hash 422695043, now seen corresponding path program 1 times [2025-03-03 23:25:17,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:25:17,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415120399] [2025-03-03 23:25:17,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:25:17,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:25:17,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 23:25:17,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 23:25:17,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:25:17,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:25:17,350 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-03 23:25:17,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:25:17,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415120399] [2025-03-03 23:25:17,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415120399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:25:17,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001825620] [2025-03-03 23:25:17,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:25:17,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:25:17,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:25:17,354 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:25:17,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:25:17,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 23:25:17,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 23:25:17,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:25:17,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:25:17,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:25:17,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:25:17,522 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-03 23:25:17,523 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:25:17,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001825620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:25:17,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:25:17,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:25:17,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020729520] [2025-03-03 23:25:17,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:25:17,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:25:17,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:25:17,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:25:17,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:25:17,545 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-03 23:25:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:25:17,561 INFO L93 Difference]: Finished difference Result 112 states and 193 transitions. [2025-03-03 23:25:17,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:25:17,562 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-03 23:25:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:25:17,567 INFO L225 Difference]: With dead ends: 112 [2025-03-03 23:25:17,567 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 23:25:17,569 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-03 23:25:17,571 INFO L435 NwaCegarLoop]: 83 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, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:25:17,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:25:17,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 23:25:17,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-03 23:25:17,595 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-03 23:25:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2025-03-03 23:25:17,599 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 135 [2025-03-03 23:25:17,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:25:17,599 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2025-03-03 23:25:17,600 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-03 23:25:17,600 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2025-03-03 23:25:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 23:25:17,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:25:17,603 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-03 23:25:17,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:25:17,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:25:17,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:25:17,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:25:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash -609238335, now seen corresponding path program 1 times [2025-03-03 23:25:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:25:17,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079747494] [2025-03-03 23:25:17,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:25:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:25:17,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 23:25:17,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 23:25:17,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:25:17,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:25:17,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [4634797] [2025-03-03 23:25:17,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:25:17,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:25:17,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:25:17,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:25:17,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:25:18,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 23:25:18,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 23:25:18,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:25:18,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:25:18,064 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:25:18,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 23:25:18,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 23:25:18,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:25:18,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:25:18,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:25:18,168 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:25:18,169 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:25:18,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 23:25:18,370 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-03 23:25:18,373 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 23:25:18,447 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:25:18,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:25:18 BoogieIcfgContainer [2025-03-03 23:25:18,449 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:25:18,450 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:25:18,450 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:25:18,450 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:25:18,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:25:17" (3/4) ... [2025-03-03 23:25:18,452 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:25:18,452 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:25:18,453 INFO L158 Benchmark]: Toolchain (without parser) took 2008.25ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 109.2MB in the end (delta: 23.8MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2025-03-03 23:25:18,453 INFO L158 Benchmark]: CDTParser took 1.01ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:25:18,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.53ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 120.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:25:18,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.86ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 118.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:25:18,456 INFO L158 Benchmark]: Boogie Preprocessor took 21.38ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 117.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:25:18,456 INFO L158 Benchmark]: IcfgBuilder took 324.13ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 101.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:25:18,456 INFO L158 Benchmark]: TraceAbstraction took 1428.17ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 109.3MB in the end (delta: -8.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:25:18,456 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 109.2MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:25:18,457 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.01ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.53ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 120.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.86ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 118.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.38ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 117.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 324.13ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 101.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1428.17ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 109.3MB in the end (delta: -8.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 109.2MB in the end (delta: 50.8kB). 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 91, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 98. 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] COND TRUE 1 [L110] FCALL updateLastVariables() [L111] 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=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] [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=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] [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=1, 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_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=1, 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=1, 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_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=1, 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] [L111] RET updateVariables() [L112] 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=1, 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=1, 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=1, 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=1, 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] [L112] RET step() [L113] 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=1, 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, EXPR property() [L113] 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=1, 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=1, 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, 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, 83 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, 83 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, 300 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-03 23:25:18,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_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 8e71cde4c3ce759247922c8d73cd0482952aedbfd0a1826f55f8bb77593825aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:25:20,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:25:20,389 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:25:20,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:25:20,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:25:20,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:25:20,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:25:20,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:25:20,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:25:20,412 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:25:20,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:25:20,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:25:20,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:25:20,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:25:20,413 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:25:20,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:25:20,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:25:20,413 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:25:20,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:25:20,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:25:20,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:25:20,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:25:20,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:25:20,414 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:25:20,414 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:25:20,414 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:25:20,414 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:25:20,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:25:20,414 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:25:20,414 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:25:20,414 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:25:20,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:25:20,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:25:20,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:25:20,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:25:20,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:25:20,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:25:20,415 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:25:20,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:25:20,415 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:25:20,415 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:25:20,415 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:25:20,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:25:20,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:25:20,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:25:20,416 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 -> 8e71cde4c3ce759247922c8d73cd0482952aedbfd0a1826f55f8bb77593825aa [2025-03-03 23:25:20,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:25:20,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:25:20,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:25:20,641 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:25:20,641 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:25:20,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-80.i [2025-03-03 23:25:21,857 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/decdc32f1/db082e9b69cf4cc6941e90a596867a0b/FLAG1dada3fde [2025-03-03 23:25:22,018 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:25:22,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-80.i [2025-03-03 23:25:22,028 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/decdc32f1/db082e9b69cf4cc6941e90a596867a0b/FLAG1dada3fde [2025-03-03 23:25:22,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/decdc32f1/db082e9b69cf4cc6941e90a596867a0b [2025-03-03 23:25:22,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:25:22,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:25:22,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:25:22,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:25:22,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:25:22,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:25:22" (1/1) ... [2025-03-03 23:25:22,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47646d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:22, skipping insertion in model container [2025-03-03 23:25:22,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:25:22" (1/1) ... [2025-03-03 23:25:22,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:25:22,544 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-while_file-80.i[915,928] [2025-03-03 23:25:22,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:25:22,588 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:25:22,599 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-while_file-80.i[915,928] [2025-03-03 23:25:22,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:25:22,632 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:25:22,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:22 WrapperNode [2025-03-03 23:25:22,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:25:22,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:25:22,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:25:22,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:25:22,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:22" (1/1) ... [2025-03-03 23:25:22,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:22" (1/1) ... [2025-03-03 23:25:22,662 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-03-03 23:25:22,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:25:22,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:25:22,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:25:22,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:25:22,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:22" (1/1) ... [2025-03-03 23:25:22,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:22" (1/1) ... [2025-03-03 23:25:22,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:22" (1/1) ... [2025-03-03 23:25:22,683 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:25:22,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:22" (1/1) ... [2025-03-03 23:25:22,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:22" (1/1) ... [2025-03-03 23:25:22,689 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:22" (1/1) ... [2025-03-03 23:25:22,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:22" (1/1) ... [2025-03-03 23:25:22,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:22" (1/1) ... [2025-03-03 23:25:22,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:22" (1/1) ... [2025-03-03 23:25:22,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:25:22,702 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:25:22,703 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:25:22,703 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:25:22,703 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:22" (1/1) ... [2025-03-03 23:25:22,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:25:22,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:25:22,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:25:22,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:25:22,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:25:22,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:25:22,759 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:25:22,759 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:25:22,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:25:22,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:25:22,822 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:25:22,823 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:25:24,085 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 23:25:24,085 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:25:24,092 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:25:24,092 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:25:24,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:25:24 BoogieIcfgContainer [2025-03-03 23:25:24,093 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:25:24,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:25:24,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:25:24,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:25:24,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:25:22" (1/3) ... [2025-03-03 23:25:24,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a47c539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:25:24, skipping insertion in model container [2025-03-03 23:25:24,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:25:22" (2/3) ... [2025-03-03 23:25:24,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a47c539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:25:24, skipping insertion in model container [2025-03-03 23:25:24,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:25:24" (3/3) ... [2025-03-03 23:25:24,099 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-80.i [2025-03-03 23:25:24,108 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:25:24,109 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-80.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:25:24,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:25:24,154 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;@73bc8c29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:25:24,155 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:25:24,158 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-03 23:25:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 23:25:24,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:25:24,167 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-03 23:25:24,168 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:25:24,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:25:24,171 INFO L85 PathProgramCache]: Analyzing trace with hash 422695043, now seen corresponding path program 1 times [2025-03-03 23:25:24,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:25:24,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901477456] [2025-03-03 23:25:24,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:25:24,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:25:24,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:25:24,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:25:24,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 23:25:24,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 23:25:24,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 23:25:24,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:25:24,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:25:24,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:25:24,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:25:24,503 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-03 23:25:24,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:25:24,503 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:25:24,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901477456] [2025-03-03 23:25:24,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901477456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:25:24,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:25:24,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:25:24,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525163752] [2025-03-03 23:25:24,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:25:24,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:25:24,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:25:24,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:25:24,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:25:24,538 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-03 23:25:24,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:25:24,553 INFO L93 Difference]: Finished difference Result 112 states and 193 transitions. [2025-03-03 23:25:24,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:25:24,555 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-03 23:25:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:25:24,563 INFO L225 Difference]: With dead ends: 112 [2025-03-03 23:25:24,563 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 23:25:24,566 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-03 23:25:24,569 INFO L435 NwaCegarLoop]: 83 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, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:25:24,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:25:24,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 23:25:24,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-03 23:25:24,595 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-03 23:25:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2025-03-03 23:25:24,599 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 135 [2025-03-03 23:25:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:25:24,599 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2025-03-03 23:25:24,599 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-03 23:25:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2025-03-03 23:25:24,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 23:25:24,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:25:24,602 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-03 23:25:24,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 23:25:24,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:25:24,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:25:24,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:25:24,804 INFO L85 PathProgramCache]: Analyzing trace with hash -609238335, now seen corresponding path program 1 times [2025-03-03 23:25:24,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:25:24,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226195867] [2025-03-03 23:25:24,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:25:24,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:25:24,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:25:24,808 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:25:24,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 23:25:24,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 23:25:25,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 23:25:25,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:25:25,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:25:25,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 23:25:25,102 INFO L279 TraceCheckSpWp]: Computing forward predicates...