./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-84.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 7e8dd03ff6ba8f306af161cccb833486a1e5ea2d1b42cd2cf566ce58d3c9e67f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:26:09,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:26:09,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:26:09,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:26:09,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:26:09,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:26:09,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:26:09,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:26:09,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:26:09,650 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:26:09,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:26:09,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:26:09,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:26:09,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:26:09,651 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:26:09,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:26:09,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:26:09,652 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:26:09,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:26:09,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:26:09,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:26:09,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:26:09,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:26:09,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:26:09,652 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:26:09,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:26:09,652 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:26:09,652 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:26:09,653 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:26:09,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:26:09,653 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:26:09,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:26:09,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:26:09,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:26:09,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:26:09,654 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:26:09,654 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:26:09,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:26:09,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:26:09,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:26:09,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:26:09,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:26:09,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:26:09,654 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 -> 7e8dd03ff6ba8f306af161cccb833486a1e5ea2d1b42cd2cf566ce58d3c9e67f [2025-03-08 14:26:09,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:26:09,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:26:09,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:26:09,878 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:26:09,878 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:26:09,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-84.i [2025-03-08 14:26:11,038 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5150e8c7/464afc801c464fa5b6750160649391eb/FLAG493edb2a2 [2025-03-08 14:26:11,293 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:26:11,294 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-84.i [2025-03-08 14:26:11,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5150e8c7/464afc801c464fa5b6750160649391eb/FLAG493edb2a2 [2025-03-08 14:26:11,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5150e8c7/464afc801c464fa5b6750160649391eb [2025-03-08 14:26:11,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:26:11,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:26:11,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:26:11,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:26:11,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:26:11,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:26:11" (1/1) ... [2025-03-08 14:26:11,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d97fe48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:11, skipping insertion in model container [2025-03-08 14:26:11,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:26:11" (1/1) ... [2025-03-08 14:26:11,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:26:11,427 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-84.i[915,928] [2025-03-08 14:26:11,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:26:11,480 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:26:11,487 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-84.i[915,928] [2025-03-08 14:26:11,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:26:11,531 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:26:11,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:11 WrapperNode [2025-03-08 14:26:11,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:26:11,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:26:11,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:26:11,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:26:11,537 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:26:11" (1/1) ... [2025-03-08 14:26:11,545 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:26:11" (1/1) ... [2025-03-08 14:26:11,585 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2025-03-08 14:26:11,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:26:11,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:26:11,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:26:11,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:26:11,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:11" (1/1) ... [2025-03-08 14:26:11,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:11" (1/1) ... [2025-03-08 14:26:11,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:11" (1/1) ... [2025-03-08 14:26:11,626 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:26:11,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:11" (1/1) ... [2025-03-08 14:26:11,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:11" (1/1) ... [2025-03-08 14:26:11,631 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:11" (1/1) ... [2025-03-08 14:26:11,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:11" (1/1) ... [2025-03-08 14:26:11,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:11" (1/1) ... [2025-03-08 14:26:11,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:11" (1/1) ... [2025-03-08 14:26:11,640 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:26:11,641 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:26:11,641 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:26:11,641 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:26:11,642 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:11" (1/1) ... [2025-03-08 14:26:11,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:26:11,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:26:11,669 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:26:11,674 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:26:11,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:26:11,688 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:26:11,688 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:26:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:26:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:26:11,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:26:11,749 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:26:11,750 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:26:11,942 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-08 14:26:11,942 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:26:11,951 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:26:11,951 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:26:11,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:26:11 BoogieIcfgContainer [2025-03-08 14:26:11,951 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:26:11,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:26:11,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:26:11,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:26:11,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:26:11" (1/3) ... [2025-03-08 14:26:11,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520ac4aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:26:11, skipping insertion in model container [2025-03-08 14:26:11,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:11" (2/3) ... [2025-03-08 14:26:11,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520ac4aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:26:11, skipping insertion in model container [2025-03-08 14:26:11,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:26:11" (3/3) ... [2025-03-08 14:26:11,961 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-84.i [2025-03-08 14:26:11,971 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:26:11,972 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-84.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:26:12,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:26:12,016 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;@5843b035, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:26:12,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:26:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 14:26:12,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 14:26:12,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:26:12,025 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:26:12,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:26:12,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:26:12,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1403834939, now seen corresponding path program 1 times [2025-03-08 14:26:12,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:26:12,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622151549] [2025-03-08 14:26:12,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:26:12,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:26:12,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 14:26:12,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 14:26:12,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:26:12,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:26:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-08 14:26:12,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:26:12,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622151549] [2025-03-08 14:26:12,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622151549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:26:12,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855847914] [2025-03-08 14:26:12,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:26:12,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:26:12,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:26:12,185 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:26:12,187 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:26:12,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 14:26:12,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 14:26:12,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:26:12,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:26:12,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:26:12,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:26:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-08 14:26:12,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:26:12,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855847914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:26:12,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:26:12,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:26:12,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314473649] [2025-03-08 14:26:12,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:26:12,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:26:12,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:26:12,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:26:12,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:26:12,361 INFO L87 Difference]: Start difference. First operand has 43 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 14:26:12,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:26:12,374 INFO L93 Difference]: Finished difference Result 83 states and 128 transitions. [2025-03-08 14:26:12,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:26:12,375 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2025-03-08 14:26:12,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:26:12,379 INFO L225 Difference]: With dead ends: 83 [2025-03-08 14:26:12,380 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 14:26:12,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:26:12,383 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:26:12,384 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:26:12,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 14:26:12,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 14:26:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 14:26:12,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2025-03-08 14:26:12,408 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 76 [2025-03-08 14:26:12,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:26:12,408 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2025-03-08 14:26:12,408 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 14:26:12,408 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2025-03-08 14:26:12,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 14:26:12,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:26:12,427 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:26:12,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 14:26:12,632 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:26:12,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:26:12,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:26:12,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2089982728, now seen corresponding path program 1 times [2025-03-08 14:26:12,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:26:12,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544873477] [2025-03-08 14:26:12,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:26:12,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:26:12,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 14:26:12,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 14:26:12,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:26:12,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:26:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 14:26:12,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:26:12,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544873477] [2025-03-08 14:26:12,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544873477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:26:12,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:26:12,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:26:12,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071416216] [2025-03-08 14:26:12,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:26:12,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:26:12,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:26:12,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:26:12,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:26:12,778 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 14:26:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:26:12,795 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2025-03-08 14:26:12,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:26:12,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 76 [2025-03-08 14:26:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:26:12,796 INFO L225 Difference]: With dead ends: 77 [2025-03-08 14:26:12,796 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 14:26:12,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:26:12,797 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:26:12,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:26:12,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 14:26:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 14:26:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 14:26:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2025-03-08 14:26:12,806 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 76 [2025-03-08 14:26:12,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:26:12,808 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2025-03-08 14:26:12,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 14:26:12,808 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2025-03-08 14:26:12,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 14:26:12,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:26:12,809 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:26:12,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:26:12,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:26:12,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:26:12,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1317480887, now seen corresponding path program 1 times [2025-03-08 14:26:12,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:26:12,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626141902] [2025-03-08 14:26:12,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:26:12,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:26:12,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 14:26:12,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 14:26:12,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:26:12,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:26:12,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:26:12,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 14:26:12,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 14:26:12,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:26:12,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:26:12,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:26:12,967 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:26:12,968 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:26:12,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:26:12,972 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 14:26:13,010 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:26:13,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:26:13 BoogieIcfgContainer [2025-03-08 14:26:13,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:26:13,015 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:26:13,015 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:26:13,015 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:26:13,016 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:26:11" (3/4) ... [2025-03-08 14:26:13,019 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:26:13,019 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:26:13,020 INFO L158 Benchmark]: Toolchain (without parser) took 1705.71ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 68.9MB in the end (delta: 38.0MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2025-03-08 14:26:13,020 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:26:13,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.98ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 93.6MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:26:13,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.00ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 90.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:26:13,022 INFO L158 Benchmark]: Boogie Preprocessor took 54.34ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 85.0MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:26:13,022 INFO L158 Benchmark]: IcfgBuilder took 310.29ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 67.3MB in the end (delta: 17.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 14:26:13,022 INFO L158 Benchmark]: TraceAbstraction took 1061.27ms. Allocated memory is still 142.6MB. Free memory was 66.4MB in the beginning and 68.9MB in the end (delta: -2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:26:13,022 INFO L158 Benchmark]: Witness Printer took 4.12ms. Allocated memory is still 142.6MB. Free memory was 68.9MB in the beginning and 68.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:26:13,025 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 115.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.98ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 93.6MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.00ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 90.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.34ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 85.0MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 310.29ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 67.3MB in the end (delta: 17.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1061.27ms. Allocated memory is still 142.6MB. Free memory was 66.4MB in the beginning and 68.9MB in the end (delta: -2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.12ms. Allocated memory is still 142.6MB. Free memory was 68.9MB in the beginning and 68.9MB in the end (delta: 27.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 75, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of someBinaryFLOATComparisonOperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] unsigned char var_1_4 = 25; [L24] unsigned char var_1_5 = 64; [L25] unsigned char var_1_6 = 8; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 10; [L28] float var_1_9 = 9.6; [L29] float var_1_10 = 99.08; [L30] float var_1_11 = 63.4; [L31] float var_1_12 = 32.125; [L32] signed long int var_1_13 = -8; [L33] signed short int var_1_14 = -2; VAL [isInitial=0, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=25, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L88] isInitial = 1 [L89] FCALL initially() [L90] int k_loop; [L91] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=25, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L91] COND TRUE k_loop < 1 [L92] FCALL updateLastVariables() [L93] CALL updateVariables() [L62] var_1_4 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L63] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L64] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L64] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L65] var_1_5 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L66] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L67] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L67] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L68] var_1_6 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_7=0, var_1_8=10, var_1_9=48/5] [L69] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_7=0, var_1_8=10, var_1_9=48/5] [L70] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=0, var_1_8=10, var_1_9=48/5] [L70] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=0, var_1_8=10, var_1_9=48/5] [L71] var_1_7 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_8=10, var_1_9=48/5] [L72] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_8=10, var_1_9=48/5] [L73] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=10, var_1_9=48/5] [L73] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=10, var_1_9=48/5] [L74] var_1_10 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=10, var_1_9=48/5] [L75] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=10, var_1_9=48/5] [L76] var_1_11 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=10, var_1_9=48/5] [L77] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=10, var_1_9=48/5] [L78] var_1_12 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=10, var_1_9=48/5] [L79] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=10, var_1_9=48/5] [L93] RET updateVariables() [L94] CALL step() [L37] unsigned char stepLocal_1 = var_1_4; VAL [isInitial=1, stepLocal_1=126, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=10, var_1_9=48/5] [L38] COND TRUE var_1_5 > stepLocal_1 [L39] var_1_8 = (128 - ((((10) > (var_1_5)) ? (10) : (var_1_5)))) VAL [isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=1, var_1_9=48/5] [L41] var_1_13 = var_1_7 [L42] var_1_14 = var_1_7 [L43] signed short int stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=127, var_1_13=127, var_1_14=127, var_1_1=128, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=1, var_1_9=48/5] [L44] COND FALSE !(var_1_14 != stepLocal_0) [L47] var_1_1 = ((((((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) < (var_1_7)) ? (((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) : (var_1_7))) VAL [isInitial=1, var_1_13=127, var_1_14=127, var_1_1=126, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=1, var_1_9=48/5] [L49] signed long int stepLocal_3 = var_1_13; [L50] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, stepLocal_2=126, stepLocal_3=127, var_1_13=127, var_1_14=127, var_1_1=126, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=1, var_1_9=48/5] [L51] COND FALSE !((var_1_10 * var_1_11) > 16.75f) VAL [isInitial=1, stepLocal_2=126, stepLocal_3=127, var_1_13=127, var_1_14=127, var_1_1=126, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=1, var_1_9=48/5] [L94] RET step() [L95] CALL, EXPR property() [L84-L85] return (((((var_1_14 != var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + ((((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) > (var_1_7)) ? (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) : (var_1_7)))))) : (var_1_1 == ((unsigned char) ((((((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) < (var_1_7)) ? (((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) : (var_1_7)))))) && ((var_1_5 > var_1_4) ? (var_1_8 == ((unsigned char) (128 - ((((10) > (var_1_5)) ? (10) : (var_1_5)))))) : 1)) && (((var_1_10 * var_1_11) > 16.75f) ? ((var_1_7 <= var_1_1) ? ((-8 > var_1_13) ? (var_1_9 == ((float) var_1_12)) : 1) : (var_1_9 == ((float) var_1_12))) : 1)) && (var_1_13 == ((signed long int) var_1_7))) && (var_1_14 == ((signed short int) var_1_7)) ; VAL [\result=0, isInitial=1, var_1_13=127, var_1_14=127, var_1_1=126, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=1, var_1_9=48/5] [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=127, var_1_14=127, var_1_1=126, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=1, var_1_9=48/5] [L19] reach_error() VAL [isInitial=1, var_1_13=127, var_1_14=127, var_1_1=126, var_1_4=126, var_1_5=127, var_1_6=126, var_1_7=127, var_1_8=1, var_1_9=48/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 71 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 160 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 111 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 190 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 640/660 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:26:13,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-84.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 7e8dd03ff6ba8f306af161cccb833486a1e5ea2d1b42cd2cf566ce58d3c9e67f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:26:14,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:26:14,931 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:26:14,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:26:14,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:26:14,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:26:14,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:26:14,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:26:14,958 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:26:14,958 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:26:14,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:26:14,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:26:14,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:26:14,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:26:14,959 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:26:14,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:26:14,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:26:14,960 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:26:14,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:26:14,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:26:14,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:26:14,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:26:14,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:26:14,960 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:26:14,960 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:26:14,961 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:26:14,961 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:26:14,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:26:14,961 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:26:14,961 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:26:14,961 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:26:14,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:26:14,961 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:26:14,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:26:14,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:26:14,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:26:14,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:26:14,962 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:26:14,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:26:14,962 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:26:14,962 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:26:14,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:26:14,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:26:14,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:26:14,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:26:14,963 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 -> 7e8dd03ff6ba8f306af161cccb833486a1e5ea2d1b42cd2cf566ce58d3c9e67f [2025-03-08 14:26:15,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:26:15,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:26:15,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:26:15,220 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:26:15,220 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:26:15,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-84.i [2025-03-08 14:26:16,390 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ac925685/2d995636117340eca2293df925385814/FLAG7f3bbf5b1 [2025-03-08 14:26:16,582 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:26:16,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-84.i [2025-03-08 14:26:16,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ac925685/2d995636117340eca2293df925385814/FLAG7f3bbf5b1 [2025-03-08 14:26:16,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ac925685/2d995636117340eca2293df925385814 [2025-03-08 14:26:16,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:26:16,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:26:16,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:26:16,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:26:16,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:26:16,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:26:16" (1/1) ... [2025-03-08 14:26:16,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671c484b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:16, skipping insertion in model container [2025-03-08 14:26:16,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:26:16" (1/1) ... [2025-03-08 14:26:16,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:26:16,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-84.i[915,928] [2025-03-08 14:26:16,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:26:16,792 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:26:16,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-84.i[915,928] [2025-03-08 14:26:16,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:26:16,833 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:26:16,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:16 WrapperNode [2025-03-08 14:26:16,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:26:16,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:26:16,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:26:16,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:26:16,842 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:26:16" (1/1) ... [2025-03-08 14:26:16,852 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:26:16" (1/1) ... [2025-03-08 14:26:16,871 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2025-03-08 14:26:16,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:26:16,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:26:16,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:26:16,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:26:16,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:16" (1/1) ... [2025-03-08 14:26:16,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:16" (1/1) ... [2025-03-08 14:26:16,882 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:16" (1/1) ... [2025-03-08 14:26:16,900 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:26:16,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:16" (1/1) ... [2025-03-08 14:26:16,902 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:16" (1/1) ... [2025-03-08 14:26:16,910 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:16" (1/1) ... [2025-03-08 14:26:16,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:16" (1/1) ... [2025-03-08 14:26:16,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:16" (1/1) ... [2025-03-08 14:26:16,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:16" (1/1) ... [2025-03-08 14:26:16,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:26:16,923 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:26:16,923 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:26:16,923 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:26:16,928 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:16" (1/1) ... [2025-03-08 14:26:16,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:26:16,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:26:16,957 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:26:16,961 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:26:16,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:26:16,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:26:16,982 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:26:16,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:26:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:26:16,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:26:17,048 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:26:17,050 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:26:17,608 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-08 14:26:17,611 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:26:17,618 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:26:17,619 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:26:17,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:26:17 BoogieIcfgContainer [2025-03-08 14:26:17,620 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:26:17,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:26:17,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:26:17,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:26:17,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:26:16" (1/3) ... [2025-03-08 14:26:17,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8d8bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:26:17, skipping insertion in model container [2025-03-08 14:26:17,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:16" (2/3) ... [2025-03-08 14:26:17,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8d8bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:26:17, skipping insertion in model container [2025-03-08 14:26:17,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:26:17" (3/3) ... [2025-03-08 14:26:17,628 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-84.i [2025-03-08 14:26:17,638 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:26:17,640 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-84.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:26:17,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:26:17,689 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;@29ef0ee5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:26:17,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:26:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 14:26:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 14:26:17,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:26:17,703 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:26:17,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:26:17,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:26:17,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1403834939, now seen corresponding path program 1 times [2025-03-08 14:26:17,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:26:17,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437847629] [2025-03-08 14:26:17,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:26:17,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:26:17,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:26:17,725 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:26:17,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:26:17,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 14:26:17,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 14:26:17,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:26:17,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:26:17,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:26:17,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:26:17,977 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 14:26:17,977 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:26:17,978 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:26:17,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437847629] [2025-03-08 14:26:17,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437847629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:26:17,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:26:17,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:26:17,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248345795] [2025-03-08 14:26:17,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:26:17,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:26:17,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:26:17,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:26:17,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:26:17,997 INFO L87 Difference]: Start difference. First operand has 43 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 14:26:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:26:18,016 INFO L93 Difference]: Finished difference Result 83 states and 128 transitions. [2025-03-08 14:26:18,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:26:18,018 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2025-03-08 14:26:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:26:18,023 INFO L225 Difference]: With dead ends: 83 [2025-03-08 14:26:18,023 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 14:26:18,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:26:18,030 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:26:18,031 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:26:18,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 14:26:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 14:26:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 14:26:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2025-03-08 14:26:18,054 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 76 [2025-03-08 14:26:18,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:26:18,054 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2025-03-08 14:26:18,054 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 14:26:18,055 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2025-03-08 14:26:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 14:26:18,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:26:18,056 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:26:18,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 14:26:18,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:26:18,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:26:18,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:26:18,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2089982728, now seen corresponding path program 1 times [2025-03-08 14:26:18,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:26:18,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440164676] [2025-03-08 14:26:18,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:26:18,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:26:18,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:26:18,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:26:18,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:26:18,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 14:26:18,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 14:26:18,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:26:18,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:26:18,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 14:26:18,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:26:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 14:26:18,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:26:18,497 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:26:18,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440164676] [2025-03-08 14:26:18,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440164676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:26:18,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:26:18,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:26:18,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044703992] [2025-03-08 14:26:18,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:26:18,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:26:18,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:26:18,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:26:18,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:26:18,500 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 14:26:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:26:18,659 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2025-03-08 14:26:18,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:26:18,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 76 [2025-03-08 14:26:18,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:26:18,669 INFO L225 Difference]: With dead ends: 77 [2025-03-08 14:26:18,669 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 14:26:18,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:26:18,670 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:26:18,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:26:18,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 14:26:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 14:26:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 14:26:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2025-03-08 14:26:18,675 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 76 [2025-03-08 14:26:18,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:26:18,676 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2025-03-08 14:26:18,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 14:26:18,676 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2025-03-08 14:26:18,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 14:26:18,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:26:18,677 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:26:18,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 14:26:18,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:26:18,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:26:18,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:26:18,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1317480887, now seen corresponding path program 1 times [2025-03-08 14:26:18,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:26:18,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881056799] [2025-03-08 14:26:18,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:26:18,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:26:18,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:26:18,881 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:26:18,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 14:26:18,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 14:26:19,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 14:26:19,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:26:19,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:26:19,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 14:26:19,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:27:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 14:27:22,054 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:27:22,055 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:27:22,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881056799] [2025-03-08 14:27:22,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881056799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:27:22,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:27:22,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 14:27:22,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183119353] [2025-03-08 14:27:22,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:27:22,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 14:27:22,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:27:22,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 14:27:22,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 14:27:22,056 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 14:27:28,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:27:28,062 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2025-03-08 14:27:28,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 14:27:28,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 76 [2025-03-08 14:27:28,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:27:28,063 INFO L225 Difference]: With dead ends: 69 [2025-03-08 14:27:28,063 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 14:27:28,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 14:27:28,064 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 43 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 14:27:28,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 274 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 14:27:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 14:27:28,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2025-03-08 14:27:28,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.2) internal successors, (54), 46 states have internal predecessors, (54), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 14:27:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2025-03-08 14:27:28,072 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 76 [2025-03-08 14:27:28,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:27:28,073 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2025-03-08 14:27:28,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 14:27:28,073 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2025-03-08 14:27:28,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 14:27:28,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:27:28,074 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:28,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 14:27:28,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:27:28,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:27:28,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:27:28,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1170031946, now seen corresponding path program 1 times [2025-03-08 14:27:28,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:27:28,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862092677] [2025-03-08 14:27:28,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:27:28,275 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:27:28,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:27:28,279 INFO L229 MonitoredProcess]: Starting monitored process 5 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:27:28,279 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 (5)] Waiting until timeout for monitored process [2025-03-08 14:27:28,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 14:27:28,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 14:27:28,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:27:28,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:27:28,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 14:27:28,445 INFO L279 TraceCheckSpWp]: Computing forward predicates...