./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-58.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 9c42f4f2be0dcf024bccd221a1bf3d1e29db98dcd801b03fa6d425f50f1c2522 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:33:59,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:33:59,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:33:59,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:33:59,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:33:59,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:33:59,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:33:59,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:33:59,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:33:59,952 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:33:59,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:33:59,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:33:59,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:33:59,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:33:59,952 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:33:59,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:33:59,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:33:59,952 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:33:59,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:33:59,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:33:59,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:33:59,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:33:59,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:33:59,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:33:59,953 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:33:59,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:33:59,953 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:33:59,953 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:33:59,953 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:33:59,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:33:59,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:33:59,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:33:59,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:33:59,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:33:59,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:33:59,953 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:33:59,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:33:59,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:33:59,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:33:59,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:33:59,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:33:59,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:33:59,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:33:59,956 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 -> 9c42f4f2be0dcf024bccd221a1bf3d1e29db98dcd801b03fa6d425f50f1c2522 [2025-03-08 14:34:00,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:34:00,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:34:00,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:34:00,176 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:34:00,177 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:34:00,177 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-58.i [2025-03-08 14:34:01,306 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f892da339/57814943d5334b70b941e4c47e0d6ebd/FLAG746145722 [2025-03-08 14:34:01,559 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:34:01,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-58.i [2025-03-08 14:34:01,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f892da339/57814943d5334b70b941e4c47e0d6ebd/FLAG746145722 [2025-03-08 14:34:01,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f892da339/57814943d5334b70b941e4c47e0d6ebd [2025-03-08 14:34:01,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:34:01,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:34:01,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:34:01,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:34:01,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:34:01,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:34:01" (1/1) ... [2025-03-08 14:34:01,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc82735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:01, skipping insertion in model container [2025-03-08 14:34:01,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:34:01" (1/1) ... [2025-03-08 14:34:01,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:34:01,710 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-58.i[915,928] [2025-03-08 14:34:01,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:34:01,744 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:34:01,751 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-58.i[915,928] [2025-03-08 14:34:01,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:34:01,787 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:34:01,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:01 WrapperNode [2025-03-08 14:34:01,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:34:01,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:34:01,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:34:01,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:34:01,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:01" (1/1) ... [2025-03-08 14:34:01,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:01" (1/1) ... [2025-03-08 14:34:01,820 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2025-03-08 14:34:01,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:34:01,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:34:01,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:34:01,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:34:01,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:01" (1/1) ... [2025-03-08 14:34:01,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:01" (1/1) ... [2025-03-08 14:34:01,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:01" (1/1) ... [2025-03-08 14:34:01,838 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:34:01,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:01" (1/1) ... [2025-03-08 14:34:01,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:01" (1/1) ... [2025-03-08 14:34:01,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:01" (1/1) ... [2025-03-08 14:34:01,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:01" (1/1) ... [2025-03-08 14:34:01,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:01" (1/1) ... [2025-03-08 14:34:01,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:01" (1/1) ... [2025-03-08 14:34:01,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:34:01,850 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:34:01,850 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:34:01,850 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:34:01,851 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:01" (1/1) ... [2025-03-08 14:34:01,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:34:01,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:34:01,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:34:01,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:34:01,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:34:01,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:34:01,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:34:01,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:34:01,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:34:01,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:34:01,951 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:34:01,953 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:34:02,118 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 14:34:02,118 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:34:02,124 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:34:02,124 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:34:02,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:34:02 BoogieIcfgContainer [2025-03-08 14:34:02,125 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:34:02,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:34:02,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:34:02,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:34:02,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:34:01" (1/3) ... [2025-03-08 14:34:02,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b90b489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:34:02, skipping insertion in model container [2025-03-08 14:34:02,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:01" (2/3) ... [2025-03-08 14:34:02,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b90b489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:34:02, skipping insertion in model container [2025-03-08 14:34:02,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:34:02" (3/3) ... [2025-03-08 14:34:02,133 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-58.i [2025-03-08 14:34:02,143 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:34:02,144 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-58.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:34:02,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:34:02,191 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;@63ffd583, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:34:02,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:34:02,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 14:34:02,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 14:34:02,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:34:02,202 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:34:02,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:34:02,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:34:02,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1565094172, now seen corresponding path program 1 times [2025-03-08 14:34:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:34:02,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080852058] [2025-03-08 14:34:02,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:34:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:34:02,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 14:34:02,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 14:34:02,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:34:02,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:34:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 14:34:02,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:34:02,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080852058] [2025-03-08 14:34:02,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080852058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:34:02,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262844421] [2025-03-08 14:34:02,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:34:02,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:34:02,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:34:02,406 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:34:02,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:34:02,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 14:34:02,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 14:34:02,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:34:02,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:34:02,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:34:02,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:34:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 14:34:02,527 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:34:02,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262844421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:34:02,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:34:02,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:34:02,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241817392] [2025-03-08 14:34:02,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:34:02,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:34:02,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:34:02,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:34:02,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:34:02,548 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 14:34:02,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:34:02,565 INFO L93 Difference]: Finished difference Result 82 states and 133 transitions. [2025-03-08 14:34:02,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:34:02,567 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2025-03-08 14:34:02,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:34:02,571 INFO L225 Difference]: With dead ends: 82 [2025-03-08 14:34:02,571 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 14:34:02,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:34:02,577 INFO L435 NwaCegarLoop]: 58 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, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:34:02,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:34:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 14:34:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-08 14:34:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 14:34:02,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-03-08 14:34:02,602 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 81 [2025-03-08 14:34:02,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:34:02,603 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-03-08 14:34:02,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 14:34:02,603 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-03-08 14:34:02,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 14:34:02,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:34:02,605 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:34:02,611 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-08 14:34:02,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:34:02,806 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:34:02,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:34:02,806 INFO L85 PathProgramCache]: Analyzing trace with hash -698615362, now seen corresponding path program 1 times [2025-03-08 14:34:02,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:34:02,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360511084] [2025-03-08 14:34:02,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:34:02,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:34:02,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 14:34:02,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 14:34:02,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:34:02,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:34:02,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [305986185] [2025-03-08 14:34:02,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:34:02,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:34:02,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:34:02,902 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:34:02,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 14:34:02,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 14:34:02,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 14:34:02,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:34:02,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:34:02,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 14:34:02,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:34:03,506 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 182 proven. 27 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 14:34:03,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:34:03,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:34:03,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360511084] [2025-03-08 14:34:03,617 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:34:03,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305986185] [2025-03-08 14:34:03,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305986185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:34:03,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:34:03,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-08 14:34:03,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600473268] [2025-03-08 14:34:03,618 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 14:34:03,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 14:34:03,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:34:03,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 14:34:03,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-08 14:34:03,619 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 14:34:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:34:04,155 INFO L93 Difference]: Finished difference Result 130 states and 179 transitions. [2025-03-08 14:34:04,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 14:34:04,155 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 81 [2025-03-08 14:34:04,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:34:04,158 INFO L225 Difference]: With dead ends: 130 [2025-03-08 14:34:04,158 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 14:34:04,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2025-03-08 14:34:04,159 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 69 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 14:34:04,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 259 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 14:34:04,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 14:34:04,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 75. [2025-03-08 14:34:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 14:34:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2025-03-08 14:34:04,178 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 81 [2025-03-08 14:34:04,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:34:04,179 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2025-03-08 14:34:04,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 14:34:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2025-03-08 14:34:04,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 14:34:04,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:34:04,182 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:34:04,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 14:34:04,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 14:34:04,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:34:04,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:34:04,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1788897471, now seen corresponding path program 1 times [2025-03-08 14:34:04,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:34:04,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730042406] [2025-03-08 14:34:04,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:34:04,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:34:04,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 14:34:04,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 14:34:04,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:34:04,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:34:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 14:34:05,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:34:05,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730042406] [2025-03-08 14:34:05,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730042406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:34:05,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:34:05,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 14:34:05,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745057534] [2025-03-08 14:34:05,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:34:05,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 14:34:05,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:34:05,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 14:34:05,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 14:34:05,514 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:34:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:34:05,823 INFO L93 Difference]: Finished difference Result 103 states and 134 transitions. [2025-03-08 14:34:05,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 14:34:05,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2025-03-08 14:34:05,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:34:05,825 INFO L225 Difference]: With dead ends: 103 [2025-03-08 14:34:05,827 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 14:34:05,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-08 14:34:05,828 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 29 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:34:05,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 330 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:34:05,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 14:34:05,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. [2025-03-08 14:34:05,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 14:34:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2025-03-08 14:34:05,845 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 81 [2025-03-08 14:34:05,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:34:05,845 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2025-03-08 14:34:05,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:34:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2025-03-08 14:34:05,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 14:34:05,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:34:05,846 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:34:05,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:34:05,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:34:05,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:34:05,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1789820992, now seen corresponding path program 1 times [2025-03-08 14:34:05,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:34:05,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482346293] [2025-03-08 14:34:05,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:34:05,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:34:05,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 14:34:05,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 14:34:05,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:34:05,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:34:05,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [705037234] [2025-03-08 14:34:05,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:34:05,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:34:05,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:34:05,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:34:05,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 14:34:05,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 14:34:05,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 14:34:05,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:34:05,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:34:05,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:34:05,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 14:34:05,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 14:34:05,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:34:05,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:34:05,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:34:05,985 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:34:05,986 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:34:05,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 14:34:06,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:34:06,191 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 14:34:06,228 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:34:06,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:34:06 BoogieIcfgContainer [2025-03-08 14:34:06,234 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:34:06,235 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:34:06,235 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:34:06,235 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:34:06,236 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:34:02" (3/4) ... [2025-03-08 14:34:06,237 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:34:06,238 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:34:06,239 INFO L158 Benchmark]: Toolchain (without parser) took 4648.97ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 123.9MB in the beginning and 282.0MB in the end (delta: -158.1MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2025-03-08 14:34:06,240 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:34:06,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.87ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 111.1MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:34:06,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.10ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 108.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:34:06,241 INFO L158 Benchmark]: Boogie Preprocessor took 24.95ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 105.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:34:06,241 INFO L158 Benchmark]: IcfgBuilder took 274.70ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 88.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:34:06,242 INFO L158 Benchmark]: TraceAbstraction took 4108.21ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 88.4MB in the beginning and 282.1MB in the end (delta: -193.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:34:06,242 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 343.9MB. Free memory was 282.1MB in the beginning and 282.0MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:34:06,243 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.87ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 111.1MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.10ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 108.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.95ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 105.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 274.70ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 88.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4108.21ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 88.4MB in the beginning and 282.1MB in the end (delta: -193.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 343.9MB. Free memory was 282.1MB in the beginning and 282.0MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 64; [L23] signed long int var_1_2 = 8; [L24] unsigned char var_1_3 = 25; [L25] unsigned char var_1_4 = 100; [L26] float var_1_5 = 99999999999.5; [L27] unsigned char var_1_6 = 4; [L28] float var_1_7 = 63.75; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char last_1_var_1_1 = 64; [L32] unsigned char last_1_var_1_9 = 0; VAL [isInitial=0, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=8, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L86] last_1_var_1_1 = var_1_1 [L87] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=8, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L97] RET updateLastVariables() [L98] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_long() [L67] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L67] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L68] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L69] var_1_3 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L70] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L71] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L72] var_1_4 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_4 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L73] RET assume_abort_if_not(var_1_4 >= 63) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L74] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L74] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L75] var_1_6 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L76] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_6 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L77] RET assume_abort_if_not(var_1_6 <= 255) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_7=255/4, var_1_9=0] [L78] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_7=255/4, var_1_9=0] [L79] var_1_7 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L80] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L81] var_1_10 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L82] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L98] RET updateVariables() [L99] CALL step() [L36] signed long int stepLocal_3 = last_1_var_1_1; [L37] signed long int stepLocal_2 = var_1_3 / var_1_6; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_2=0, stepLocal_3=64, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L38] COND TRUE var_1_3 < stepLocal_3 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_2=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L39] COND FALSE !(var_1_4 < stepLocal_2) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L49] signed long int stepLocal_1 = var_1_2; [L50] signed long int stepLocal_0 = var_1_2; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, stepLocal_1=-256, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L51] COND TRUE stepLocal_1 <= -256 [L52] var_1_1 = ((((var_1_3) < (((var_1_4 - 8) + 5))) ? (var_1_3) : (((var_1_4 - 8) + 5)))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L60] unsigned char stepLocal_4 = (var_1_1 + 64u) != var_1_4; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, stepLocal_4=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L61] COND FALSE !((var_1_5 >= var_1_7) || stepLocal_4) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return (((var_1_2 <= -256) ? (var_1_1 == ((unsigned char) ((((var_1_3) < (((var_1_4 - 8) + 5))) ? (var_1_3) : (((var_1_4 - 8) + 5)))))) : ((var_1_4 <= var_1_2) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((var_1_3 < last_1_var_1_1) ? ((var_1_4 < (var_1_3 / var_1_6)) ? (var_1_5 == ((float) (var_1_7 - 16.55f))) : 1) : (last_1_var_1_9 ? (var_1_5 == ((float) var_1_7)) : (var_1_5 == ((float) var_1_7))))) && (((var_1_5 >= var_1_7) || ((var_1_1 + 64u) != var_1_4)) ? (var_1_9 == ((unsigned char) var_1_10)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 75 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 647 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 508 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 434 IncrementalHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 139 mSDtfsCounter, 434 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=3, InterpolantAutomatonStates: 28, 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, 3 MinimizatonAttempts, 36 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 567 NumberOfCodeBlocks, 567 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 320 ConstructedInterpolants, 2 QuantifiedInterpolants, 1210 SizeOfPredicates, 5 NumberOfNonLiveVariables, 396 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 1007/1056 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:34:06,264 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-58.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 9c42f4f2be0dcf024bccd221a1bf3d1e29db98dcd801b03fa6d425f50f1c2522 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:34:08,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:34:08,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:34:08,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:34:08,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:34:08,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:34:08,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:34:08,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:34:08,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:34:08,120 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:34:08,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:34:08,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:34:08,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:34:08,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:34:08,121 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:34:08,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:34:08,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:34:08,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:34:08,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:34:08,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:34:08,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:34:08,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:34:08,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:34:08,122 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:34:08,122 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:34:08,122 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:34:08,122 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:34:08,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:34:08,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:34:08,123 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:34:08,123 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:34:08,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:34:08,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:34:08,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:34:08,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:34:08,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:34:08,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:34:08,124 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:34:08,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:34:08,124 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:34:08,124 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:34:08,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:34:08,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:34:08,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:34:08,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:34:08,125 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 -> 9c42f4f2be0dcf024bccd221a1bf3d1e29db98dcd801b03fa6d425f50f1c2522 [2025-03-08 14:34:08,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:34:08,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:34:08,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:34:08,366 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:34:08,366 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:34:08,367 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-58.i [2025-03-08 14:34:09,473 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6425d5586/f73e07922c84425489e6597e36f0af59/FLAG887ee6b60 [2025-03-08 14:34:09,690 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:34:09,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-58.i [2025-03-08 14:34:09,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6425d5586/f73e07922c84425489e6597e36f0af59/FLAG887ee6b60 [2025-03-08 14:34:09,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6425d5586/f73e07922c84425489e6597e36f0af59 [2025-03-08 14:34:09,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:34:09,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:34:09,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:34:09,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:34:09,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:34:09,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:34:09" (1/1) ... [2025-03-08 14:34:09,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240e7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:09, skipping insertion in model container [2025-03-08 14:34:09,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:34:09" (1/1) ... [2025-03-08 14:34:09,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:34:09,847 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-58.i[915,928] [2025-03-08 14:34:09,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:34:09,904 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:34:09,914 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-58.i[915,928] [2025-03-08 14:34:09,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:34:09,952 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:34:09,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:09 WrapperNode [2025-03-08 14:34:09,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:34:09,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:34:09,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:34:09,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:34:09,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:09" (1/1) ... [2025-03-08 14:34:09,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:09" (1/1) ... [2025-03-08 14:34:09,991 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2025-03-08 14:34:09,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:34:09,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:34:09,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:34:09,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:34:10,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:09" (1/1) ... [2025-03-08 14:34:10,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:09" (1/1) ... [2025-03-08 14:34:10,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:09" (1/1) ... [2025-03-08 14:34:10,017 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:34:10,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:09" (1/1) ... [2025-03-08 14:34:10,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:09" (1/1) ... [2025-03-08 14:34:10,025 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:09" (1/1) ... [2025-03-08 14:34:10,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:09" (1/1) ... [2025-03-08 14:34:10,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:09" (1/1) ... [2025-03-08 14:34:10,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:09" (1/1) ... [2025-03-08 14:34:10,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:34:10,039 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:34:10,039 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:34:10,039 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:34:10,044 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:09" (1/1) ... [2025-03-08 14:34:10,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:34:10,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:34:10,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:34:10,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:34:10,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:34:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:34:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:34:10,095 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:34:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:34:10,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:34:10,156 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:34:10,158 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:34:10,436 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 14:34:10,438 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:34:10,444 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:34:10,445 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:34:10,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:34:10 BoogieIcfgContainer [2025-03-08 14:34:10,445 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:34:10,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:34:10,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:34:10,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:34:10,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:34:09" (1/3) ... [2025-03-08 14:34:10,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ab99ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:34:10, skipping insertion in model container [2025-03-08 14:34:10,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:34:09" (2/3) ... [2025-03-08 14:34:10,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ab99ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:34:10, skipping insertion in model container [2025-03-08 14:34:10,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:34:10" (3/3) ... [2025-03-08 14:34:10,456 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-58.i [2025-03-08 14:34:10,465 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:34:10,467 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-58.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:34:10,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:34:10,514 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;@7303b657, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:34:10,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:34:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 14:34:10,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 14:34:10,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:34:10,526 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:34:10,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:34:10,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:34:10,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1565094172, now seen corresponding path program 1 times [2025-03-08 14:34:10,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:34:10,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402250243] [2025-03-08 14:34:10,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:34:10,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:34:10,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:34:10,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:34:10,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:34:10,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 14:34:10,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 14:34:10,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:34:10,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:34:10,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:34:10,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:34:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-08 14:34:10,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:34:10,691 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:34:10,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402250243] [2025-03-08 14:34:10,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402250243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:34:10,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:34:10,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:34:10,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418931926] [2025-03-08 14:34:10,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:34:10,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:34:10,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:34:10,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:34:10,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:34:10,710 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 14:34:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:34:10,724 INFO L93 Difference]: Finished difference Result 82 states and 133 transitions. [2025-03-08 14:34:10,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:34:10,725 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2025-03-08 14:34:10,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:34:10,729 INFO L225 Difference]: With dead ends: 82 [2025-03-08 14:34:10,730 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 14:34:10,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:34:10,734 INFO L435 NwaCegarLoop]: 58 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, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:34:10,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:34:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 14:34:10,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-08 14:34:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 14:34:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-03-08 14:34:10,762 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 81 [2025-03-08 14:34:10,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:34:10,762 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-03-08 14:34:10,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 14:34:10,762 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-03-08 14:34:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 14:34:10,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:34:10,764 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:34:10,771 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-08 14:34:10,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:34:10,965 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:34:10,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:34:10,966 INFO L85 PathProgramCache]: Analyzing trace with hash -698615362, now seen corresponding path program 1 times [2025-03-08 14:34:10,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:34:10,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4723413] [2025-03-08 14:34:10,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:34:10,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:34:10,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:34:10,969 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:34:10,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:34:11,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 14:34:11,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 14:34:11,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:34:11,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:34:11,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 14:34:11,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:34:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 179 proven. 39 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 14:34:12,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:34:27,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:34:27,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4723413] [2025-03-08 14:34:27,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4723413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:34:27,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [240551788] [2025-03-08 14:34:27,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:34:27,403 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 14:34:27,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 14:34:27,405 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 14:34:27,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-08 14:34:27,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 14:34:27,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 14:34:27,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:34:27,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:34:27,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 14:34:27,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:34:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-08 14:34:48,692 INFO L312 TraceCheckSpWp]: Computing backward predicates...