./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-74.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 5d4fe864ddf00d95f4d026fe5bd498728240b2ee00db5ab4ba3b8c46d3e76c6e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:36:07,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:36:07,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:36:07,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:36:07,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:36:07,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:36:07,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:36:07,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:36:07,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:36:07,756 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:36:07,756 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:36:07,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:36:07,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:36:07,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:36:07,757 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:36:07,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:36:07,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:36:07,757 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:36:07,757 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:36:07,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:36:07,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:36:07,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:36:07,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:36:07,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:36:07,758 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:36:07,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:36:07,758 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:36:07,758 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:36:07,758 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:36:07,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:36:07,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:36:07,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:36:07,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:36:07,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:36:07,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:36:07,758 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:36:07,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:36:07,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:36:07,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:36:07,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:36:07,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:36:07,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:36:07,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:36:07,759 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 -> 5d4fe864ddf00d95f4d026fe5bd498728240b2ee00db5ab4ba3b8c46d3e76c6e [2025-03-08 14:36:07,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:36:07,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:36:07,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:36:07,997 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:36:07,997 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:36:07,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-74.i [2025-03-08 14:36:09,178 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf1a27ca/a06838f4fc024f4b8b4782b538b3665e/FLAGec6e2b547 [2025-03-08 14:36:09,403 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:36:09,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-74.i [2025-03-08 14:36:09,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf1a27ca/a06838f4fc024f4b8b4782b538b3665e/FLAGec6e2b547 [2025-03-08 14:36:09,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf1a27ca/a06838f4fc024f4b8b4782b538b3665e [2025-03-08 14:36:09,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:36:09,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:36:09,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:36:09,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:36:09,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:36:09,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:36:09" (1/1) ... [2025-03-08 14:36:09,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67e8df59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:09, skipping insertion in model container [2025-03-08 14:36:09,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:36:09" (1/1) ... [2025-03-08 14:36:09,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:36:09,552 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-74.i[915,928] [2025-03-08 14:36:09,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:36:09,600 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:36:09,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-74.i[915,928] [2025-03-08 14:36:09,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:36:09,638 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:36:09,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:09 WrapperNode [2025-03-08 14:36:09,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:36:09,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:36:09,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:36:09,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:36:09,645 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:36:09" (1/1) ... [2025-03-08 14:36:09,651 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:36:09" (1/1) ... [2025-03-08 14:36:09,673 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-08 14:36:09,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:36:09,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:36:09,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:36:09,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:36:09,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:09" (1/1) ... [2025-03-08 14:36:09,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:09" (1/1) ... [2025-03-08 14:36:09,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:09" (1/1) ... [2025-03-08 14:36:09,697 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:36:09,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:09" (1/1) ... [2025-03-08 14:36:09,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:09" (1/1) ... [2025-03-08 14:36:09,700 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:09" (1/1) ... [2025-03-08 14:36:09,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:09" (1/1) ... [2025-03-08 14:36:09,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:09" (1/1) ... [2025-03-08 14:36:09,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:09" (1/1) ... [2025-03-08 14:36:09,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:36:09,711 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:36:09,711 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:36:09,711 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:36:09,711 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:09" (1/1) ... [2025-03-08 14:36:09,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:36:09,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:36:09,735 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:36:09,737 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:36:09,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:36:09,752 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:36:09,752 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:36:09,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:36:09,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:36:09,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:36:09,806 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:36:09,807 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:36:09,943 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 14:36:09,943 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:36:09,949 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:36:09,950 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:36:09,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:36:09 BoogieIcfgContainer [2025-03-08 14:36:09,950 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:36:09,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:36:09,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:36:09,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:36:09,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:36:09" (1/3) ... [2025-03-08 14:36:09,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f0fc48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:36:09, skipping insertion in model container [2025-03-08 14:36:09,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:09" (2/3) ... [2025-03-08 14:36:09,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f0fc48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:36:09, skipping insertion in model container [2025-03-08 14:36:09,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:36:09" (3/3) ... [2025-03-08 14:36:09,956 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-74.i [2025-03-08 14:36:09,966 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:36:09,968 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-74.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:36:10,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:36:10,017 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;@6ffc2f73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:36:10,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:36:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 14:36:10,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 14:36:10,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:36:10,028 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:10,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:36:10,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:36:10,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1082816437, now seen corresponding path program 1 times [2025-03-08 14:36:10,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:36:10,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34525614] [2025-03-08 14:36:10,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:36:10,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:36:10,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 14:36:10,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 14:36:10,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:36:10,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:36:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 14:36:10,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:36:10,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34525614] [2025-03-08 14:36:10,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34525614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:36:10,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106373536] [2025-03-08 14:36:10,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:36:10,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:36:10,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:36:10,236 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:36:10,238 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:36:10,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 14:36:10,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 14:36:10,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:36:10,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:36:10,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:36:10,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:36:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 14:36:10,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:36:10,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106373536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:36:10,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:36:10,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:36:10,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425485987] [2025-03-08 14:36:10,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:36:10,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:36:10,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:36:10,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:36:10,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:36:10,400 INFO L87 Difference]: Start difference. First operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 14:36:10,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:36:10,416 INFO L93 Difference]: Finished difference Result 94 states and 151 transitions. [2025-03-08 14:36:10,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:36:10,419 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2025-03-08 14:36:10,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:36:10,423 INFO L225 Difference]: With dead ends: 94 [2025-03-08 14:36:10,423 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 14:36:10,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 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:36:10,430 INFO L435 NwaCegarLoop]: 66 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, 66 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:36:10,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:36:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 14:36:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-08 14:36:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 14:36:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2025-03-08 14:36:10,466 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 95 [2025-03-08 14:36:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:36:10,466 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2025-03-08 14:36:10,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 14:36:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2025-03-08 14:36:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 14:36:10,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:36:10,470 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:10,477 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:36:10,675 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:36:10,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:36:10,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:36:10,677 INFO L85 PathProgramCache]: Analyzing trace with hash 484736837, now seen corresponding path program 1 times [2025-03-08 14:36:10,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:36:10,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3328708] [2025-03-08 14:36:10,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:36:10,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:36:10,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 14:36:10,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 14:36:10,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:36:10,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:36:10,848 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:36:10,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 14:36:10,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 14:36:10,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:36:10,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:36:10,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:36:10,957 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:36:10,958 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:36:10,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:36:10,961 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 14:36:11,018 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:36:11,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:36:11 BoogieIcfgContainer [2025-03-08 14:36:11,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:36:11,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:36:11,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:36:11,021 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:36:11,022 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:36:09" (3/4) ... [2025-03-08 14:36:11,023 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:36:11,024 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:36:11,025 INFO L158 Benchmark]: Toolchain (without parser) took 1595.85ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 80.3MB in the end (delta: 25.2MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2025-03-08 14:36:11,025 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:36:11,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.73ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 92.8MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:36:11,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.68ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:36:11,026 INFO L158 Benchmark]: Boogie Preprocessor took 30.80ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 89.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:36:11,026 INFO L158 Benchmark]: IcfgBuilder took 239.35ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 74.3MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:36:11,026 INFO L158 Benchmark]: TraceAbstraction took 1068.70ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 80.3MB in the end (delta: -6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:36:11,026 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 80.3MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:36:11,027 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.64ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.73ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 92.8MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.68ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.80ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 89.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 239.35ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 74.3MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1068.70ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 80.3MB in the end (delta: -6.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 80.3MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 25; [L23] double var_1_2 = 63.25; [L24] double var_1_3 = 3.779; [L25] double var_1_4 = 31.6; [L26] double var_1_5 = 100.5; [L27] unsigned long int var_1_6 = 64; [L28] unsigned long int var_1_7 = 3150951169; [L29] unsigned long int var_1_8 = 128; [L30] unsigned char var_1_9 = 0; [L31] signed short int var_1_10 = -16; [L32] float var_1_11 = 127.075; [L33] float var_1_12 = 1.2; [L34] signed short int var_1_16 = 4; [L35] signed short int var_1_18 = -64; [L36] signed char var_1_19 = -32; VAL [isInitial=0, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_2=253/4, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] FCALL updateLastVariables() [L101] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_double() [L66] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L66] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L67] var_1_3 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L68] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L69] var_1_4 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L70] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L71] var_1_5 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L72] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L73] var_1_6 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L75] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L76] var_1_7 = __VERIFIER_nondet_ulong() [L77] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=128, var_1_9=0] [L77] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=128, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_7 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=128, var_1_9=0] [L78] RET assume_abort_if_not(var_1_7 <= 4294967294) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=128, var_1_9=0] [L79] var_1_8 = __VERIFIER_nondet_ulong() [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_9=0] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=0] [L81] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=0] [L82] var_1_9 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647] [L83] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647] [L84] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] [L84] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] [L85] var_1_11 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_11 >= 0.0F && 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_10=-16, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] [L86] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] [L87] var_1_12 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] [L88] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] [L101] RET updateVariables() [L102] CALL step() [L40] COND TRUE ((((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) < (var_1_4)) ? (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) < var_1_5 [L41] var_1_1 = ((((var_1_6) > ((var_1_7 - var_1_8))) ? (var_1_6) : ((var_1_7 - var_1_8)))) VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=4294967297, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] [L49] var_1_19 = -2 VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-2, var_1_1=4294967297, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] [L50] COND TRUE \read(var_1_9) VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-2, var_1_1=4294967297, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] [L51] COND FALSE !(255.5f != (var_1_11 - var_1_12)) VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-2, var_1_1=4294967297, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] [L59] COND TRUE \read(var_1_9) [L60] var_1_16 = ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) VAL [isInitial=1, var_1_10=-16, var_1_16=2, var_1_18=-64, var_1_19=-2, var_1_1=4294967297, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] [L62] var_1_18 = var_1_19 VAL [isInitial=1, var_1_10=-16, var_1_16=2, var_1_18=-2, var_1_19=-2, var_1_1=4294967297, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] [L102] RET step() [L103] CALL, EXPR property() [L93-L94] return (((((((((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) < (var_1_4)) ? (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) < var_1_5) ? (var_1_1 == ((unsigned long int) ((((var_1_6) > ((var_1_7 - var_1_8))) ? (var_1_6) : ((var_1_7 - var_1_8)))))) : (var_1_9 ? (var_1_1 == ((unsigned long int) var_1_7)) : (var_1_1 == ((unsigned long int) var_1_6)))) && (var_1_9 ? ((255.5f != (var_1_11 - var_1_12)) ? (var_1_10 == ((signed short int) ((((((((var_1_19) > (var_1_19)) ? (var_1_19) : (var_1_19)))) > (var_1_19)) ? (((((var_1_19) > (var_1_19)) ? (var_1_19) : (var_1_19)))) : (var_1_19))))) : 1) : ((var_1_4 <= var_1_3) ? (var_1_10 == ((signed short int) var_1_19)) : 1))) && (var_1_9 ? (var_1_16 == ((signed short int) ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) : 1)) && (var_1_18 == ((signed short int) var_1_19))) && (var_1_19 == ((signed char) -2)) ; VAL [\result=0, isInitial=1, var_1_10=-16, var_1_16=2, var_1_18=-2, var_1_19=-2, var_1_1=4294967297, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-16, var_1_16=2, var_1_18=-2, var_1_19=-2, var_1_1=4294967297, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=-16, var_1_16=2, var_1_18=-2, var_1_19=-2, var_1_1=4294967297, var_1_6=4294967297, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 85 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 66 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 219 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 702/728 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:36:11,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-74.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 5d4fe864ddf00d95f4d026fe5bd498728240b2ee00db5ab4ba3b8c46d3e76c6e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:36:12,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:36:12,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:36:12,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:36:12,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:36:12,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:36:12,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:36:12,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:36:12,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:36:12,975 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:36:12,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:36:12,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:36:12,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:36:12,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:36:12,976 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:36:12,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:36:12,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:36:12,976 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:36:12,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:36:12,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:36:12,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:36:12,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:36:12,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:36:12,977 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:36:12,977 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:36:12,977 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:36:12,977 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:36:12,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:36:12,977 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:36:12,977 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:36:12,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:36:12,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:36:12,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:36:12,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:36:12,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:36:12,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:36:12,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:36:12,978 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:36:12,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:36:12,978 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:36:12,978 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:36:12,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:36:12,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:36:12,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:36:12,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:36:12,979 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 -> 5d4fe864ddf00d95f4d026fe5bd498728240b2ee00db5ab4ba3b8c46d3e76c6e [2025-03-08 14:36:13,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:36:13,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:36:13,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:36:13,219 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:36:13,219 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:36:13,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-74.i [2025-03-08 14:36:14,400 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559416b84/347e16ff79ae4bcb9ce5a1483b33d238/FLAGda75a12c8 [2025-03-08 14:36:14,572 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:36:14,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-74.i [2025-03-08 14:36:14,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559416b84/347e16ff79ae4bcb9ce5a1483b33d238/FLAGda75a12c8 [2025-03-08 14:36:14,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559416b84/347e16ff79ae4bcb9ce5a1483b33d238 [2025-03-08 14:36:14,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:36:14,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:36:14,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:36:14,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:36:14,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:36:14,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:36:14" (1/1) ... [2025-03-08 14:36:14,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2437eaf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:14, skipping insertion in model container [2025-03-08 14:36:14,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:36:14" (1/1) ... [2025-03-08 14:36:14,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:36:14,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-74.i[915,928] [2025-03-08 14:36:14,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:36:14,762 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:36:14,770 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-74.i[915,928] [2025-03-08 14:36:14,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:36:14,798 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:36:14,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:14 WrapperNode [2025-03-08 14:36:14,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:36:14,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:36:14,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:36:14,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:36:14,803 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:36:14" (1/1) ... [2025-03-08 14:36:14,809 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:36:14" (1/1) ... [2025-03-08 14:36:14,824 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-08 14:36:14,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:36:14,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:36:14,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:36:14,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:36:14,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:14" (1/1) ... [2025-03-08 14:36:14,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:14" (1/1) ... [2025-03-08 14:36:14,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:14" (1/1) ... [2025-03-08 14:36:14,844 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:36:14,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:14" (1/1) ... [2025-03-08 14:36:14,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:14" (1/1) ... [2025-03-08 14:36:14,853 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:14" (1/1) ... [2025-03-08 14:36:14,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:14" (1/1) ... [2025-03-08 14:36:14,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:14" (1/1) ... [2025-03-08 14:36:14,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:14" (1/1) ... [2025-03-08 14:36:14,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:36:14,865 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:36:14,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:36:14,865 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:36:14,866 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:14" (1/1) ... [2025-03-08 14:36:14,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:36:14,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:36:14,891 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:36:14,894 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:36:14,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:36:14,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:36:14,914 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:36:14,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:36:14,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:36:14,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:36:14,976 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:36:14,978 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:36:15,388 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 14:36:15,389 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:36:15,395 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:36:15,396 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:36:15,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:36:15 BoogieIcfgContainer [2025-03-08 14:36:15,396 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:36:15,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:36:15,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:36:15,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:36:15,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:36:14" (1/3) ... [2025-03-08 14:36:15,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77117d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:36:15, skipping insertion in model container [2025-03-08 14:36:15,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:36:14" (2/3) ... [2025-03-08 14:36:15,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77117d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:36:15, skipping insertion in model container [2025-03-08 14:36:15,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:36:15" (3/3) ... [2025-03-08 14:36:15,404 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-74.i [2025-03-08 14:36:15,413 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:36:15,414 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-74.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:36:15,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:36:15,456 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;@656fb061, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:36:15,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:36:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 14:36:15,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 14:36:15,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:36:15,464 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:15,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:36:15,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:36:15,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1082816437, now seen corresponding path program 1 times [2025-03-08 14:36:15,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:36:15,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484981099] [2025-03-08 14:36:15,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:36:15,475 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:36:15,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:36:15,477 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:36:15,478 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:36:15,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 14:36:15,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 14:36:15,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:36:15,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:36:15,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:36:15,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:36:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-08 14:36:15,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:36:15,696 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:36:15,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484981099] [2025-03-08 14:36:15,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484981099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:36:15,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:36:15,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:36:15,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316307507] [2025-03-08 14:36:15,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:36:15,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:36:15,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:36:15,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:36:15,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:36:15,718 INFO L87 Difference]: Start difference. First operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 14:36:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:36:15,733 INFO L93 Difference]: Finished difference Result 94 states and 151 transitions. [2025-03-08 14:36:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:36:15,734 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2025-03-08 14:36:15,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:36:15,739 INFO L225 Difference]: With dead ends: 94 [2025-03-08 14:36:15,739 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 14:36:15,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 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:36:15,743 INFO L435 NwaCegarLoop]: 66 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, 66 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:36:15,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:36:15,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 14:36:15,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-08 14:36:15,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 14:36:15,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2025-03-08 14:36:15,780 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 95 [2025-03-08 14:36:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:36:15,781 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2025-03-08 14:36:15,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 14:36:15,781 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2025-03-08 14:36:15,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 14:36:15,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:36:15,783 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:15,790 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:36:15,983 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:36:15,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:36:15,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:36:15,985 INFO L85 PathProgramCache]: Analyzing trace with hash 484736837, now seen corresponding path program 1 times [2025-03-08 14:36:15,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:36:15,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070238924] [2025-03-08 14:36:15,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:36:15,986 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:36:15,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:36:15,988 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:36:15,989 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:36:16,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 14:36:16,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 14:36:16,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:36:16,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:36:16,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 14:36:16,165 INFO L279 TraceCheckSpWp]: Computing forward predicates...