./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.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 ddce48067b4423a9dbd4ae41b2384910d5e8f4f139aef66a78ce087435d0c23b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:18:13,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:18:13,853 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:18:13,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:18:13,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:18:13,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:18:13,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:18:13,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:18:13,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:18:13,884 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:18:13,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:18:13,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:18:13,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:18:13,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:18:13,885 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:18:13,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:18:13,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:18:13,885 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:18:13,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:18:13,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:18:13,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:18:13,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:18:13,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:18:13,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:18:13,886 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:18:13,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:18:13,886 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:18:13,886 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:18:13,886 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:18:13,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:18:13,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:18:13,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:18:13,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:18:13,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:18:13,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:18:13,887 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:18:13,887 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:18:13,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:18:13,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:18:13,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:18:13,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:18:13,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:18:13,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:18:13,888 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 -> ddce48067b4423a9dbd4ae41b2384910d5e8f4f139aef66a78ce087435d0c23b [2025-03-03 23:18:14,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:18:14,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:18:14,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:18:14,124 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:18:14,125 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:18:14,126 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-26.i [2025-03-03 23:18:15,261 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c91d5ef/bb93845f01c742d0b995bade692a634d/FLAG652b1af7f [2025-03-03 23:18:15,501 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:18:15,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.i [2025-03-03 23:18:15,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c91d5ef/bb93845f01c742d0b995bade692a634d/FLAG652b1af7f [2025-03-03 23:18:15,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c91d5ef/bb93845f01c742d0b995bade692a634d [2025-03-03 23:18:15,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:18:15,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:18:15,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:18:15,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:18:15,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:18:15,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:18:15" (1/1) ... [2025-03-03 23:18:15,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f8da617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:15, skipping insertion in model container [2025-03-03 23:18:15,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:18:15" (1/1) ... [2025-03-03 23:18:15,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:18:15,961 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-26.i[915,928] [2025-03-03 23:18:16,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:18:16,013 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:18:16,022 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-26.i[915,928] [2025-03-03 23:18:16,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:18:16,054 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:18:16,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:16 WrapperNode [2025-03-03 23:18:16,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:18:16,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:18:16,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:18:16,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:18:16,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:16" (1/1) ... [2025-03-03 23:18:16,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:16" (1/1) ... [2025-03-03 23:18:16,092 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2025-03-03 23:18:16,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:18:16,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:18:16,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:18:16,097 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:18:16,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:16" (1/1) ... [2025-03-03 23:18:16,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:16" (1/1) ... [2025-03-03 23:18:16,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:16" (1/1) ... [2025-03-03 23:18:16,121 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:18:16,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:16" (1/1) ... [2025-03-03 23:18:16,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:16" (1/1) ... [2025-03-03 23:18:16,128 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:16" (1/1) ... [2025-03-03 23:18:16,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:16" (1/1) ... [2025-03-03 23:18:16,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:16" (1/1) ... [2025-03-03 23:18:16,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:16" (1/1) ... [2025-03-03 23:18:16,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:18:16,133 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:18:16,133 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:18:16,133 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:18:16,135 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:16" (1/1) ... [2025-03-03 23:18:16,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:18:16,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:18:16,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:18:16,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:18:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:18:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:18:16,184 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:18:16,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:18:16,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:18:16,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:18:16,233 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:18:16,235 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:18:16,424 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 23:18:16,424 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:18:16,432 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:18:16,433 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:18:16,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:18:16 BoogieIcfgContainer [2025-03-03 23:18:16,433 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:18:16,436 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:18:16,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:18:16,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:18:16,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:18:15" (1/3) ... [2025-03-03 23:18:16,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3231d6ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:18:16, skipping insertion in model container [2025-03-03 23:18:16,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:16" (2/3) ... [2025-03-03 23:18:16,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3231d6ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:18:16, skipping insertion in model container [2025-03-03 23:18:16,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:18:16" (3/3) ... [2025-03-03 23:18:16,442 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-26.i [2025-03-03 23:18:16,452 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:18:16,454 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-26.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:18:16,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:18:16,510 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;@7da57dc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:18:16,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:18:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 23:18:16,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 23:18:16,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:16,523 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:18:16,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:16,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:16,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1088172704, now seen corresponding path program 1 times [2025-03-03 23:18:16,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:16,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005782705] [2025-03-03 23:18:16,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:16,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:16,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 23:18:16,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 23:18:16,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:16,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-03 23:18:16,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:16,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005782705] [2025-03-03 23:18:16,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005782705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:18:16,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623221912] [2025-03-03 23:18:16,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:16,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:18:16,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:18:16,741 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:18:16,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:18:16,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 23:18:16,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 23:18:16,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:16,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:16,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:18:16,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:18:16,885 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-03 23:18:16,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:18:16,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623221912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:16,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:18:16,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:18:16,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476848010] [2025-03-03 23:18:16,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:16,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:18:16,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:16,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:18:16,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:18:16,906 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 23:18:16,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:16,924 INFO L93 Difference]: Finished difference Result 96 states and 160 transitions. [2025-03-03 23:18:16,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:18:16,925 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2025-03-03 23:18:16,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:16,929 INFO L225 Difference]: With dead ends: 96 [2025-03-03 23:18:16,929 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 23:18:16,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:18:16,932 INFO L435 NwaCegarLoop]: 69 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, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:16,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:18:16,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 23:18:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-03 23:18:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 23:18:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-03-03 23:18:16,958 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 107 [2025-03-03 23:18:16,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:16,958 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-03-03 23:18:16,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 23:18:16,958 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-03-03 23:18:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 23:18:16,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:16,961 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:18:16,967 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-03 23:18:17,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:18:17,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:17,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:17,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1601682909, now seen corresponding path program 1 times [2025-03-03 23:18:17,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:17,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390175219] [2025-03-03 23:18:17,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:17,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:17,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 23:18:17,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 23:18:17,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:17,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:18:17,277 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:18:17,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 23:18:17,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 23:18:17,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:17,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:18:17,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:18:17,375 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:18:17,376 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:18:17,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:18:17,379 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 23:18:17,417 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:18:17,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:18:17 BoogieIcfgContainer [2025-03-03 23:18:17,419 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:18:17,420 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:18:17,420 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:18:17,420 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:18:17,421 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:18:16" (3/4) ... [2025-03-03 23:18:17,422 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:18:17,423 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:18:17,424 INFO L158 Benchmark]: Toolchain (without parser) took 1580.67ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 85.5MB in the end (delta: 20.3MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2025-03-03 23:18:17,424 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:18:17,424 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.73ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 93.8MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:18:17,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.84ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:18:17,425 INFO L158 Benchmark]: Boogie Preprocessor took 34.91ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:18:17,426 INFO L158 Benchmark]: IcfgBuilder took 300.63ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 74.7MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:18:17,426 INFO L158 Benchmark]: TraceAbstraction took 983.76ms. Allocated memory is still 142.6MB. Free memory was 73.7MB in the beginning and 85.5MB in the end (delta: -11.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:18:17,426 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 85.5MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:18:17,427 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.73ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 93.8MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.84ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.91ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 300.63ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 74.7MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 983.76ms. Allocated memory is still 142.6MB. Free memory was 73.7MB in the beginning and 85.5MB in the end (delta: -11.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 85.5MB 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 someBinaryArithmeticDOUBLEoperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -1; [L23] signed short int var_1_4 = 1; [L24] signed short int var_1_5 = -10; [L25] double var_1_6 = 10.4; [L26] double var_1_7 = 100000000000000.2; [L27] double var_1_8 = 99.4; [L28] double var_1_9 = 49.825; [L29] unsigned short int var_1_10 = 50; [L30] unsigned char var_1_11 = 0; [L31] double var_1_12 = 4.3; [L32] double var_1_13 = 2.875; [L33] unsigned short int var_1_14 = 64; [L34] unsigned short int var_1_15 = 50; VAL [isInitial=0, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=1, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] FCALL updateLastVariables() [L100] CALL updateVariables() [L61] var_1_4 = __VERIFIER_nondet_short() [L62] CALL assume_abort_if_not(var_1_4 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L62] RET assume_abort_if_not(var_1_4 >= -32767) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L63] CALL assume_abort_if_not(var_1_4 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L63] RET assume_abort_if_not(var_1_4 <= 32766) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L65] RET assume_abort_if_not(var_1_5 >= -32767) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L66] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L66] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L67] var_1_7 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_8=497/5, var_1_9=1993/40] [L68] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_8=497/5, var_1_9=1993/40] [L69] var_1_8 = __VERIFIER_nondet_double() [L70] 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=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_9=1993/40] [L70] 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=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_9=1993/40] [L71] var_1_9 = __VERIFIER_nondet_double() [L72] 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=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L72] 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=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L73] var_1_11 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L74] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=50, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L75] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L75] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L76] var_1_12 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && 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=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L77] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L78] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L78] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L79] var_1_13 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L80] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L81] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L81] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L82] var_1_14 = __VERIFIER_nondet_ushort() [L83] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L83] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L84] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L84] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L85] var_1_15 = __VERIFIER_nondet_ushort() [L86] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L86] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L87] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L87] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L100] RET updateVariables() [L101] CALL step() [L38] var_1_6 = (var_1_7 - (var_1_8 + var_1_9)) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-1, var_1_4=-5, var_1_5=-4] [L39] COND TRUE var_1_6 > var_1_6 [L40] var_1_1 = ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-4, var_1_4=-5, var_1_5=-4] [L44] signed long int stepLocal_1 = 100; [L45] unsigned char stepLocal_0 = var_1_8 <= (var_1_7 + var_1_9); VAL [isInitial=1, stepLocal_0=0, stepLocal_1=100, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-4, var_1_4=-5, var_1_5=-4] [L46] COND FALSE !(var_1_11 || stepLocal_0) VAL [isInitial=1, stepLocal_1=100, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-4, var_1_4=-5, var_1_5=-4] [L101] RET step() [L102] CALL, EXPR property() [L92-L93] return (((var_1_6 > var_1_6) ? (var_1_1 == ((signed short int) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : (var_1_1 == ((signed short int) ((((-4) < (var_1_5)) ? (-4) : (var_1_5)))))) && (var_1_6 == ((double) (var_1_7 - (var_1_8 + var_1_9))))) && ((var_1_11 || (var_1_8 <= (var_1_7 + var_1_9))) ? ((((var_1_7 + var_1_6) / ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13)))) <= var_1_9) ? ((var_1_6 > 2.5) ? ((100 > var_1_1) ? (var_1_10 == ((unsigned short int) var_1_14)) : (var_1_10 == ((unsigned short int) var_1_15))) : (var_1_10 == ((unsigned short int) var_1_14))) : 1) : 1) ; VAL [\result=0, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-4, var_1_4=-5, var_1_5=-4] [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-4, var_1_4=-5, var_1_5=-4] [L19] reach_error() VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-4, var_1_4=-5, var_1_5=-4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 17, 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, 69 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, 69 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred 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, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 243 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1056/1088 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:18:17,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.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 ddce48067b4423a9dbd4ae41b2384910d5e8f4f139aef66a78ce087435d0c23b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:18:19,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:18:19,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:18:19,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:18:19,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:18:19,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:18:19,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:18:19,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:18:19,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:18:19,347 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:18:19,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:18:19,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:18:19,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:18:19,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:18:19,348 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:18:19,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:18:19,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:18:19,349 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:18:19,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:18:19,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:18:19,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:18:19,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:18:19,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:18:19,349 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:18:19,349 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:18:19,350 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:18:19,350 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:18:19,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:18:19,350 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:18:19,350 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:18:19,350 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:18:19,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:18:19,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:18:19,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:18:19,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:18:19,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:18:19,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:18:19,351 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:18:19,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:18:19,351 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:18:19,351 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:18:19,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:18:19,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:18:19,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:18:19,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:18:19,352 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 -> ddce48067b4423a9dbd4ae41b2384910d5e8f4f139aef66a78ce087435d0c23b [2025-03-03 23:18:19,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:18:19,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:18:19,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:18:19,566 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:18:19,568 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:18:19,568 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-26.i [2025-03-03 23:18:20,684 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af06be849/630488051b2041dfb0905a50e54e7ebf/FLAG779011efd [2025-03-03 23:18:20,902 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:18:20,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.i [2025-03-03 23:18:20,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af06be849/630488051b2041dfb0905a50e54e7ebf/FLAG779011efd [2025-03-03 23:18:21,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af06be849/630488051b2041dfb0905a50e54e7ebf [2025-03-03 23:18:21,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:18:21,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:18:21,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:18:21,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:18:21,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:18:21,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:18:21" (1/1) ... [2025-03-03 23:18:21,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd46de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:21, skipping insertion in model container [2025-03-03 23:18:21,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:18:21" (1/1) ... [2025-03-03 23:18:21,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:18:21,367 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-26.i[915,928] [2025-03-03 23:18:21,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:18:21,411 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:18:21,418 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-26.i[915,928] [2025-03-03 23:18:21,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:18:21,443 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:18:21,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:21 WrapperNode [2025-03-03 23:18:21,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:18:21,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:18:21,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:18:21,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:18:21,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:21" (1/1) ... [2025-03-03 23:18:21,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:21" (1/1) ... [2025-03-03 23:18:21,468 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-03 23:18:21,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:18:21,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:18:21,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:18:21,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:18:21,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:21" (1/1) ... [2025-03-03 23:18:21,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:21" (1/1) ... [2025-03-03 23:18:21,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:21" (1/1) ... [2025-03-03 23:18:21,484 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:18:21,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:21" (1/1) ... [2025-03-03 23:18:21,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:21" (1/1) ... [2025-03-03 23:18:21,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:21" (1/1) ... [2025-03-03 23:18:21,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:21" (1/1) ... [2025-03-03 23:18:21,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:21" (1/1) ... [2025-03-03 23:18:21,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:21" (1/1) ... [2025-03-03 23:18:21,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:18:21,502 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:18:21,502 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:18:21,502 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:18:21,503 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:21" (1/1) ... [2025-03-03 23:18:21,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:18:21,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:18:21,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:18:21,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:18:21,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:18:21,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:18:21,549 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:18:21,549 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:18:21,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:18:21,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:18:21,605 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:18:21,607 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:18:35,766 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 23:18:35,766 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:18:35,775 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:18:35,776 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:18:35,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:18:35 BoogieIcfgContainer [2025-03-03 23:18:35,777 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:18:35,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:18:35,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:18:35,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:18:35,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:18:21" (1/3) ... [2025-03-03 23:18:35,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf76f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:18:35, skipping insertion in model container [2025-03-03 23:18:35,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:18:21" (2/3) ... [2025-03-03 23:18:35,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf76f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:18:35, skipping insertion in model container [2025-03-03 23:18:35,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:18:35" (3/3) ... [2025-03-03 23:18:35,786 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-26.i [2025-03-03 23:18:35,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:18:35,798 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-26.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:18:35,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:18:35,838 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;@3a51daf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:18:35,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:18:35,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 23:18:35,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 23:18:35,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:35,847 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:18:35,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:35,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:35,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1088172704, now seen corresponding path program 1 times [2025-03-03 23:18:35,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:18:35,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410113196] [2025-03-03 23:18:35,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:35,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:18:35,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:18:35,860 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:18:35,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 23:18:35,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 23:18:36,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 23:18:36,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:36,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:36,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:18:36,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:18:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2025-03-03 23:18:36,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:18:36,832 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:18:36,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410113196] [2025-03-03 23:18:36,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410113196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:36,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:36,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:18:36,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506060917] [2025-03-03 23:18:36,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:36,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:18:36,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:18:36,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:18:36,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:18:36,853 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 23:18:36,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:36,868 INFO L93 Difference]: Finished difference Result 96 states and 160 transitions. [2025-03-03 23:18:36,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:18:36,870 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2025-03-03 23:18:36,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:36,876 INFO L225 Difference]: With dead ends: 96 [2025-03-03 23:18:36,877 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 23:18:36,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:18:36,882 INFO L435 NwaCegarLoop]: 68 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, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:36,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:18:36,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 23:18:36,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-03 23:18:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 23:18:36,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-03-03 23:18:36,922 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 107 [2025-03-03 23:18:36,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:36,923 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-03-03 23:18:36,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 23:18:36,924 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-03-03 23:18:36,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 23:18:36,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:36,926 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:18:36,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 23:18:37,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:18:37,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:37,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:37,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1805780706, now seen corresponding path program 1 times [2025-03-03 23:18:37,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:18:37,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370395009] [2025-03-03 23:18:37,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:37,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:18:37,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:18:37,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:18:37,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 23:18:37,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 23:18:38,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 23:18:38,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:38,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:38,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 23:18:38,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:19:22,930 WARN L286 SmtUtils]: Spent 10.84s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 23:19:57,498 WARN L286 SmtUtils]: Spent 10.76s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)