./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.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 828b6f31ac8b338b9524f85315068e4bc72bfadb1d19ff8ea6318f966a3b277a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:17:25,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:17:25,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:17:25,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:17:25,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:17:25,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:17:25,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:17:25,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:17:25,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:17:25,273 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:17:25,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:17:25,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:17:25,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:17:25,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:17:25,274 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:17:25,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:17:25,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:17:25,275 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:17:25,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:17:25,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:17:25,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:17:25,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:17:25,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:17:25,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:17:25,275 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:17:25,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:17:25,276 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:17:25,276 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:17:25,276 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:17:25,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:17:25,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:17:25,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:17:25,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:17:25,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:17:25,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:17:25,277 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:17:25,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:17:25,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:17:25,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:17:25,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:17:25,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:17:25,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:17:25,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:17:25,277 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 -> 828b6f31ac8b338b9524f85315068e4bc72bfadb1d19ff8ea6318f966a3b277a [2025-03-08 14:17:25,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:17:25,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:17:25,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:17:25,501 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:17:25,501 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:17:25,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.i [2025-03-08 14:17:26,593 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a20631b0/0d7bfa1b6a614aa1b45d105f4097600d/FLAGfe66c23cc [2025-03-08 14:17:26,804 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:17:26,805 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.i [2025-03-08 14:17:26,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a20631b0/0d7bfa1b6a614aa1b45d105f4097600d/FLAGfe66c23cc [2025-03-08 14:17:27,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a20631b0/0d7bfa1b6a614aa1b45d105f4097600d [2025-03-08 14:17:27,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:17:27,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:17:27,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:17:27,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:17:27,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:17:27,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:17:27" (1/1) ... [2025-03-08 14:17:27,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6812484a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:27, skipping insertion in model container [2025-03-08 14:17:27,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:17:27" (1/1) ... [2025-03-08 14:17:27,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:17:27,301 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.i[914,927] [2025-03-08 14:17:27,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:17:27,344 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:17:27,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.i[914,927] [2025-03-08 14:17:27,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:17:27,386 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:17:27,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:27 WrapperNode [2025-03-08 14:17:27,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:17:27,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:17:27,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:17:27,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:17:27,392 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:17:27" (1/1) ... [2025-03-08 14:17:27,397 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:17:27" (1/1) ... [2025-03-08 14:17:27,409 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2025-03-08 14:17:27,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:17:27,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:17:27,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:17:27,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:17:27,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:27" (1/1) ... [2025-03-08 14:17:27,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:27" (1/1) ... [2025-03-08 14:17:27,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:27" (1/1) ... [2025-03-08 14:17:27,425 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:17:27,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:27" (1/1) ... [2025-03-08 14:17:27,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:27" (1/1) ... [2025-03-08 14:17:27,436 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:27" (1/1) ... [2025-03-08 14:17:27,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:27" (1/1) ... [2025-03-08 14:17:27,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:27" (1/1) ... [2025-03-08 14:17:27,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:27" (1/1) ... [2025-03-08 14:17:27,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:17:27,444 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:17:27,444 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:17:27,444 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:17:27,445 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:27" (1/1) ... [2025-03-08 14:17:27,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:17:27,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:17:27,485 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:17:27,488 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:17:27,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:17:27,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:17:27,506 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:17:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:17:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:17:27,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:17:27,556 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:17:27,558 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:17:27,747 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:17:27,747 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:17:27,757 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:17:27,759 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:17:27,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:17:27 BoogieIcfgContainer [2025-03-08 14:17:27,759 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:17:27,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:17:27,761 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:17:27,764 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:17:27,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:17:27" (1/3) ... [2025-03-08 14:17:27,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66941263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:17:27, skipping insertion in model container [2025-03-08 14:17:27,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:27" (2/3) ... [2025-03-08 14:17:27,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66941263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:17:27, skipping insertion in model container [2025-03-08 14:17:27,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:17:27" (3/3) ... [2025-03-08 14:17:27,767 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-0.i [2025-03-08 14:17:27,779 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:17:27,780 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-0.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:17:27,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:17:27,830 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;@64f4a852, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:17:27,831 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:17:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 14:17:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 14:17:27,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:17:27,845 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:27,846 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:17:27,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:17:27,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1851851570, now seen corresponding path program 1 times [2025-03-08 14:17:27,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:17:27,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344971036] [2025-03-08 14:17:27,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:17:27,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:17:27,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 14:17:27,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 14:17:27,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:17:27,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:17:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-08 14:17:28,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:17:28,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344971036] [2025-03-08 14:17:28,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344971036] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:17:28,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283585581] [2025-03-08 14:17:28,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:17:28,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:17:28,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:17:28,007 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:17:28,009 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:17:28,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 14:17:28,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 14:17:28,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:17:28,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:17:28,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:17:28,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:17:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-08 14:17:28,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:17:28,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283585581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:17:28,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:17:28,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:17:28,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122952284] [2025-03-08 14:17:28,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:17:28,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:17:28,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:17:28,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:17:28,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:17:28,146 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:17:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:17:28,159 INFO L93 Difference]: Finished difference Result 83 states and 126 transitions. [2025-03-08 14:17:28,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:17:28,161 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2025-03-08 14:17:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:17:28,165 INFO L225 Difference]: With dead ends: 83 [2025-03-08 14:17:28,165 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 14:17:28,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 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:17:28,171 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:17:28,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:17:28,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 14:17:28,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 14:17:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 14:17:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2025-03-08 14:17:28,194 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 66 [2025-03-08 14:17:28,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:17:28,194 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2025-03-08 14:17:28,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:17:28,194 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2025-03-08 14:17:28,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 14:17:28,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:17:28,196 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:28,202 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:17:28,396 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:17:28,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:17:28,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:17:28,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1545086093, now seen corresponding path program 1 times [2025-03-08 14:17:28,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:17:28,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624296801] [2025-03-08 14:17:28,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:17:28,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:17:28,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 14:17:28,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 14:17:28,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:17:28,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:17:28,451 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:17:28,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 14:17:28,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 14:17:28,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:17:28,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:17:28,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:17:28,518 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:17:28,519 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:17:28,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:17:28,523 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 14:17:28,559 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:17:28,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:17:28 BoogieIcfgContainer [2025-03-08 14:17:28,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:17:28,563 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:17:28,563 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:17:28,563 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:17:28,564 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:17:27" (3/4) ... [2025-03-08 14:17:28,565 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:17:28,566 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:17:28,566 INFO L158 Benchmark]: Toolchain (without parser) took 1389.60ms. Allocated memory is still 167.8MB. Free memory was 134.8MB in the beginning and 60.6MB in the end (delta: 74.3MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-08 14:17:28,567 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:17:28,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.98ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 122.5MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:17:28,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.21ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 121.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:17:28,567 INFO L158 Benchmark]: Boogie Preprocessor took 33.80ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 119.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:17:28,567 INFO L158 Benchmark]: IcfgBuilder took 315.55ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 104.9MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:17:28,570 INFO L158 Benchmark]: TraceAbstraction took 801.57ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 60.6MB in the end (delta: 43.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 14:17:28,571 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 167.8MB. Free memory is still 60.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:17:28,572 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.98ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 122.5MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.21ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 121.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.80ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 119.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 315.55ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 104.9MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 801.57ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 60.6MB in the end (delta: 43.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 167.8MB. Free memory is still 60.6MB. 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 someBinaryArithmeticDOUBLEoperation at line 36, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 25.8; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 128.2; [L25] double var_1_4 = 15.4; [L26] double var_1_5 = 5.25; [L27] unsigned char var_1_6 = 0; [L28] float var_1_7 = 8.125; [L29] float var_1_8 = 0.4; [L30] float var_1_9 = 499.4; [L31] float var_1_10 = 63.16; VAL [isInitial=0, var_1_10=1579/25, var_1_1=129/5, var_1_2=1, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L86] isInitial = 1 [L87] FCALL initially() [L88] int k_loop; [L89] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=1579/25, var_1_1=129/5, var_1_2=1, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L89] COND TRUE k_loop < 1 [L90] FCALL updateLastVariables() [L91] CALL updateVariables() [L62] var_1_2 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L63] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L64] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L64] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L65] var_1_3 = __VERIFIER_nondet_double() [L66] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L66] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L67] var_1_4 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L68] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L72] var_1_8 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_9=2497/5] [L73] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_9=2497/5] [L74] var_1_9 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L75] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L76] var_1_10 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L77] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L91] RET updateVariables() [L92] CALL step() [L35] COND TRUE ! var_1_2 [L36] var_1_1 = (var_1_3 - var_1_4) VAL [isInitial=1, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L40] unsigned char stepLocal_0 = var_1_4 < var_1_3; VAL [isInitial=1, stepLocal_0=0, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L41] COND FALSE !(stepLocal_0 || var_1_2) VAL [isInitial=1, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L48] unsigned char stepLocal_1 = var_1_1 <= (var_1_1 + var_1_3); VAL [isInitial=1, stepLocal_1=1, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L49] COND TRUE var_1_2 || stepLocal_1 [L50] var_1_7 = ((((5.5f) < (((((128.4f) > (var_1_3)) ? (128.4f) : (var_1_3))))) ? (5.5f) : (((((128.4f) > (var_1_3)) ? (128.4f) : (var_1_3)))))) VAL [isInitial=1, var_1_2=0, var_1_3=11/2, var_1_5=21/4, var_1_6=1, var_1_7=11/2] [L92] RET step() [L93] CALL, EXPR property() [L82-L83] return (((! var_1_2) ? (var_1_1 == ((double) (var_1_3 - var_1_4))) : (var_1_1 == ((double) ((((16.2) < (var_1_3)) ? (16.2) : (var_1_3)))))) && (((var_1_4 < var_1_3) || var_1_2) ? (var_1_2 ? (var_1_6 ? (var_1_5 == ((double) var_1_3)) : 1) : 1) : 1)) && ((var_1_2 || (var_1_1 <= (var_1_1 + var_1_3))) ? (var_1_7 == ((float) ((((5.5f) < (((((128.4f) > (var_1_3)) ? (128.4f) : (var_1_3))))) ? (5.5f) : (((((128.4f) > (var_1_3)) ? (128.4f) : (var_1_3)))))))) : (var_1_6 ? (var_1_7 == ((float) ((var_1_8 - var_1_9) + var_1_10))) : (var_1_2 ? (var_1_7 == ((float) var_1_9)) : 1))) ; VAL [\result=0, isInitial=1, var_1_2=0, var_1_3=11/2, var_1_5=21/4, var_1_6=1, var_1_7=11/2] [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_2=0, var_1_3=11/2, var_1_5=21/4, var_1_6=1, var_1_7=11/2] [L19] reach_error() VAL [isInitial=1, var_1_2=0, var_1_3=11/2, var_1_5=21/4, var_1_6=1, var_1_7=11/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 69 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 9, 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, 58 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, 58 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 163 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 272/288 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:17:28,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.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 828b6f31ac8b338b9524f85315068e4bc72bfadb1d19ff8ea6318f966a3b277a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:17:30,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:17:30,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:17:30,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:17:30,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:17:30,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:17:30,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:17:30,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:17:30,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:17:30,494 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:17:30,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:17:30,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:17:30,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:17:30,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:17:30,494 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:17:30,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:17:30,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:17:30,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:17:30,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:17:30,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:17:30,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:17:30,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:17:30,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:17:30,495 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:17:30,495 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:17:30,495 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:17:30,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:17:30,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:17:30,496 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:17:30,496 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:17:30,496 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:17:30,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:17:30,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:17:30,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:17:30,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:17:30,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:17:30,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:17:30,496 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:17:30,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:17:30,497 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:17:30,497 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:17:30,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:17:30,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:17:30,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:17:30,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:17:30,497 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 -> 828b6f31ac8b338b9524f85315068e4bc72bfadb1d19ff8ea6318f966a3b277a [2025-03-08 14:17:30,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:17:30,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:17:30,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:17:30,737 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:17:30,737 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:17:30,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.i [2025-03-08 14:17:31,943 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0649d8abd/1bff42d0b05b49618c7df9bc691cd6e2/FLAGec28918a6 [2025-03-08 14:17:32,120 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:17:32,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.i [2025-03-08 14:17:32,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0649d8abd/1bff42d0b05b49618c7df9bc691cd6e2/FLAGec28918a6 [2025-03-08 14:17:32,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0649d8abd/1bff42d0b05b49618c7df9bc691cd6e2 [2025-03-08 14:17:32,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:17:32,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:17:32,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:17:32,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:17:32,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:17:32,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:17:32" (1/1) ... [2025-03-08 14:17:32,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198bf93f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:32, skipping insertion in model container [2025-03-08 14:17:32,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:17:32" (1/1) ... [2025-03-08 14:17:32,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:17:32,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.i[914,927] [2025-03-08 14:17:32,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:17:32,649 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:17:32,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.i[914,927] [2025-03-08 14:17:32,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:17:32,679 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:17:32,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:32 WrapperNode [2025-03-08 14:17:32,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:17:32,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:17:32,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:17:32,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:17:32,687 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:17:32" (1/1) ... [2025-03-08 14:17:32,696 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:17:32" (1/1) ... [2025-03-08 14:17:32,716 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2025-03-08 14:17:32,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:17:32,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:17:32,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:17:32,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:17:32,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:32" (1/1) ... [2025-03-08 14:17:32,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:32" (1/1) ... [2025-03-08 14:17:32,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:32" (1/1) ... [2025-03-08 14:17:32,744 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:17:32,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:32" (1/1) ... [2025-03-08 14:17:32,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:32" (1/1) ... [2025-03-08 14:17:32,753 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:32" (1/1) ... [2025-03-08 14:17:32,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:32" (1/1) ... [2025-03-08 14:17:32,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:32" (1/1) ... [2025-03-08 14:17:32,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:32" (1/1) ... [2025-03-08 14:17:32,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:17:32,762 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:17:32,762 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:17:32,762 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:17:32,763 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:32" (1/1) ... [2025-03-08 14:17:32,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:17:32,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:17:32,791 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:17:32,794 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:17:32,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:17:32,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:17:32,812 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:17:32,812 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:17:32,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:17:32,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:17:32,867 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:17:32,869 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:17:35,768 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:17:35,768 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:17:35,775 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:17:35,775 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:17:35,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:17:35 BoogieIcfgContainer [2025-03-08 14:17:35,775 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:17:35,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:17:35,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:17:35,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:17:35,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:17:32" (1/3) ... [2025-03-08 14:17:35,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3b9432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:17:35, skipping insertion in model container [2025-03-08 14:17:35,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:32" (2/3) ... [2025-03-08 14:17:35,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3b9432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:17:35, skipping insertion in model container [2025-03-08 14:17:35,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:17:35" (3/3) ... [2025-03-08 14:17:35,784 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-0.i [2025-03-08 14:17:35,793 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:17:35,795 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-0.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:17:35,831 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:17:35,841 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;@5dc79597, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:17:35,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:17:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 14:17:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 14:17:35,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:17:35,850 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:35,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:17:35,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:17:35,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1851851570, now seen corresponding path program 1 times [2025-03-08 14:17:35,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:17:35,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944708333] [2025-03-08 14:17:35,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:17:35,861 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:17:35,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:17:35,863 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:17:35,877 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:17:35,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 14:17:36,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 14:17:36,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:17:36,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:17:36,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:17:36,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:17:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 14:17:36,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:17:36,229 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:17:36,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944708333] [2025-03-08 14:17:36,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944708333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:17:36,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:17:36,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:17:36,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838875998] [2025-03-08 14:17:36,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:17:36,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:17:36,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:17:36,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:17:36,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:17:36,246 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:17:36,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:17:36,262 INFO L93 Difference]: Finished difference Result 83 states and 126 transitions. [2025-03-08 14:17:36,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:17:36,264 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2025-03-08 14:17:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:17:36,269 INFO L225 Difference]: With dead ends: 83 [2025-03-08 14:17:36,269 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 14:17:36,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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:17:36,274 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:17:36,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:17:36,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 14:17:36,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 14:17:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 14:17:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2025-03-08 14:17:36,296 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 66 [2025-03-08 14:17:36,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:17:36,296 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2025-03-08 14:17:36,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:17:36,296 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2025-03-08 14:17:36,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 14:17:36,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:17:36,301 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:36,313 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:17:36,502 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:17:36,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:17:36,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:17:36,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1545086093, now seen corresponding path program 1 times [2025-03-08 14:17:36,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:17:36,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122220876] [2025-03-08 14:17:36,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:17:36,504 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:17:36,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:17:36,506 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:17:36,508 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:17:36,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 14:17:36,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 14:17:36,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:17:36,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:17:36,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 14:17:36,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:18:08,285 WARN L286 SmtUtils]: Spent 7.63s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 14:18:41,936 WARN L286 SmtUtils]: Spent 7.33s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)