./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-94.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-94.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 ddc0508a464e42fc1f87097589b784a1207a6851d9973aeaa08029fac2a2578e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:45:32,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:45:32,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:45:32,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:45:32,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:45:32,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:45:32,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:45:32,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:45:32,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:45:32,571 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:45:32,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:45:32,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:45:32,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:45:32,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:45:32,572 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:45:32,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:45:32,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:45:32,573 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:45:32,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:45:32,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:45:32,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:45:32,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:45:32,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:45:32,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:45:32,574 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:45:32,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:45:32,574 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:45:32,574 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:45:32,574 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:45:32,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:45:32,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:45:32,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:45:32,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:45:32,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:45:32,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:45:32,574 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:45:32,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:45:32,574 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:45:32,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:45:32,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:45:32,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:45:32,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:45:32,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:45:32,575 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 -> ddc0508a464e42fc1f87097589b784a1207a6851d9973aeaa08029fac2a2578e [2025-03-17 03:45:32,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:45:32,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:45:32,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:45:32,789 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:45:32,790 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:45:32,790 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-94.i [2025-03-17 03:45:33,954 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6e90e1e8/b47ee1f21fda469787506bd020b93717/FLAG783f469ad [2025-03-17 03:45:34,204 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:45:34,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-94.i [2025-03-17 03:45:34,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6e90e1e8/b47ee1f21fda469787506bd020b93717/FLAG783f469ad [2025-03-17 03:45:34,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6e90e1e8/b47ee1f21fda469787506bd020b93717 [2025-03-17 03:45:34,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:45:34,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:45:34,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:45:34,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:45:34,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:45:34,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:45:34" (1/1) ... [2025-03-17 03:45:34,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d76000b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:34, skipping insertion in model container [2025-03-17 03:45:34,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:45:34" (1/1) ... [2025-03-17 03:45:34,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:45:34,647 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-94.i[915,928] [2025-03-17 03:45:34,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:45:34,701 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:45:34,711 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-94.i[915,928] [2025-03-17 03:45:34,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:45:34,750 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:45:34,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:34 WrapperNode [2025-03-17 03:45:34,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:45:34,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:45:34,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:45:34,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:45:34,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:34" (1/1) ... [2025-03-17 03:45:34,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:34" (1/1) ... [2025-03-17 03:45:34,779 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2025-03-17 03:45:34,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:45:34,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:45:34,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:45:34,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:45:34,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:34" (1/1) ... [2025-03-17 03:45:34,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:34" (1/1) ... [2025-03-17 03:45:34,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:34" (1/1) ... [2025-03-17 03:45:34,801 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-17 03:45:34,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:34" (1/1) ... [2025-03-17 03:45:34,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:34" (1/1) ... [2025-03-17 03:45:34,810 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:34" (1/1) ... [2025-03-17 03:45:34,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:34" (1/1) ... [2025-03-17 03:45:34,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:34" (1/1) ... [2025-03-17 03:45:34,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:34" (1/1) ... [2025-03-17 03:45:34,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:45:34,814 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:45:34,814 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:45:34,814 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:45:34,815 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:34" (1/1) ... [2025-03-17 03:45:34,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:45:34,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:45:34,840 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-17 03:45:34,842 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-17 03:45:34,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:45:34,858 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:45:34,858 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:45:34,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:45:34,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:45:34,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:45:34,915 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:45:34,917 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:45:35,087 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 03:45:35,087 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:45:35,098 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:45:35,099 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:45:35,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:35 BoogieIcfgContainer [2025-03-17 03:45:35,099 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:45:35,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:45:35,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:45:35,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:45:35,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:45:34" (1/3) ... [2025-03-17 03:45:35,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7715eb23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:45:35, skipping insertion in model container [2025-03-17 03:45:35,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:34" (2/3) ... [2025-03-17 03:45:35,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7715eb23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:45:35, skipping insertion in model container [2025-03-17 03:45:35,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:35" (3/3) ... [2025-03-17 03:45:35,107 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-94.i [2025-03-17 03:45:35,116 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:45:35,117 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-94.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:45:35,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:45:35,181 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;@61feabaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:45:35,183 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:45:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 03:45:35,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 03:45:35,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:45:35,197 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:45:35,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:45:35,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:45:35,201 INFO L85 PathProgramCache]: Analyzing trace with hash 259036924, now seen corresponding path program 1 times [2025-03-17 03:45:35,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:45:35,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142828741] [2025-03-17 03:45:35,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:45:35,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:45:35,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 03:45:35,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 03:45:35,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:35,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:45:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 03:45:35,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:45:35,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142828741] [2025-03-17 03:45:35,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142828741] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:45:35,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92176133] [2025-03-17 03:45:35,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:45:35,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:45:35,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:45:35,408 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-17 03:45:35,409 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-17 03:45:35,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 03:45:35,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 03:45:35,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:35,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:45:35,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:45:35,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:45:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 03:45:35,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:45:35,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92176133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:45:35,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:45:35,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:45:35,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617663907] [2025-03-17 03:45:35,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:45:35,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:45:35,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:45:35,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:45:35,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:45:35,593 INFO L87 Difference]: Start difference. First operand has 53 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 03:45:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:45:35,611 INFO L93 Difference]: Finished difference Result 103 states and 181 transitions. [2025-03-17 03:45:35,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:45:35,612 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 127 [2025-03-17 03:45:35,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:45:35,616 INFO L225 Difference]: With dead ends: 103 [2025-03-17 03:45:35,616 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 03:45:35,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-17 03:45:35,619 INFO L435 NwaCegarLoop]: 77 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, 77 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-17 03:45:35,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:45:35,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 03:45:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 03:45:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 03:45:35,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 77 transitions. [2025-03-17 03:45:35,646 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 77 transitions. Word has length 127 [2025-03-17 03:45:35,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:45:35,647 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 77 transitions. [2025-03-17 03:45:35,647 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 03:45:35,647 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 77 transitions. [2025-03-17 03:45:35,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 03:45:35,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:45:35,649 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:45:35,657 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-17 03:45:35,850 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-17 03:45:35,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:45:35,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:45:35,851 INFO L85 PathProgramCache]: Analyzing trace with hash 857665089, now seen corresponding path program 1 times [2025-03-17 03:45:35,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:45:35,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953509745] [2025-03-17 03:45:35,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:45:35,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:45:35,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 03:45:35,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 03:45:35,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:35,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:45:35,956 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:45:35,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 03:45:36,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 03:45:36,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:36,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:45:36,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:45:36,066 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:45:36,067 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:45:36,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:45:36,071 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 03:45:36,141 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:45:36,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:45:36 BoogieIcfgContainer [2025-03-17 03:45:36,145 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:45:36,146 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:45:36,146 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:45:36,146 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:45:36,147 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:35" (3/4) ... [2025-03-17 03:45:36,149 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:45:36,149 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:45:36,150 INFO L158 Benchmark]: Toolchain (without parser) took 1623.08ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 111.2MB in the end (delta: 11.2MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2025-03-17 03:45:36,150 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:45:36,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.53ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 109.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:45:36,151 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.25ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:45:36,151 INFO L158 Benchmark]: Boogie Preprocessor took 32.08ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 106.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:45:36,151 INFO L158 Benchmark]: IcfgBuilder took 285.15ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 90.1MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:45:36,152 INFO L158 Benchmark]: TraceAbstraction took 1044.59ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 111.2MB in the end (delta: -21.6MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2025-03-17 03:45:36,152 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 111.2MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:45:36,155 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.73ms. Allocated memory is still 201.3MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.53ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 109.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.25ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.08ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 106.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 285.15ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 90.1MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1044.59ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 111.2MB in the end (delta: -21.6MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 111.2MB in the end (delta: 50.8kB). 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 43, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 73. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 63.4; [L23] float var_1_2 = 25.2; [L24] float var_1_3 = 3.75; [L25] double var_1_4 = 0.0; [L26] double var_1_5 = 63.4; [L27] double var_1_6 = 3.7; [L28] unsigned char var_1_7 = 0; [L29] double var_1_8 = 63.75; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 0; [L32] signed char var_1_11 = -64; [L33] signed char var_1_12 = -32; [L34] signed char var_1_13 = 2; [L35] signed char var_1_14 = -4; [L36] signed char var_1_15 = -25; [L37] signed char var_1_16 = 5; [L38] signed long int var_1_17 = -2; [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_3=15/4, var_1_4=0, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_3=15/4, var_1_4=0, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L65] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_3=15/4, var_1_4=0, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L66] var_1_3 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_4=0, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_4=0, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L67] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_4=0, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L68] var_1_4 = __VERIFIER_nondet_double() [L69] CALL assume_abort_if_not((var_1_4 >= 4611686.018427382800e+12F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L69] RET assume_abort_if_not((var_1_4 >= 4611686.018427382800e+12F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L70] var_1_5 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L71] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L72] var_1_6 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_8=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_8=255/4, var_1_9=0] [L73] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_8=255/4, var_1_9=0] [L74] var_1_8 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=0] [L75] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_8 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_8 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=0] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L78] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L79] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L80] var_1_10 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L81] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L82] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L83] var_1_12 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L84] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L85] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L85] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L88] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L89] var_1_14 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L91] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L92] var_1_15 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_15 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_15 >= -31) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_15 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L94] RET assume_abort_if_not(var_1_15 <= 32) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L95] var_1_16 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_16 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=31, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=31, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L96] RET assume_abort_if_not(var_1_16 >= -31) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=31, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L97] CALL assume_abort_if_not(var_1_16 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=31, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=31, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L97] RET assume_abort_if_not(var_1_16 <= 31) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=31, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=1] [L110] RET updateVariables() [L111] CALL step() [L42] COND TRUE var_1_2 != var_1_3 [L43] var_1_1 = ((var_1_4 - var_1_5) - var_1_6) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=31, var_1_17=-2, var_1_7=0, var_1_9=1] [L45] COND FALSE !(var_1_5 > (var_1_1 / var_1_4)) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=31, var_1_17=-2, var_1_7=0, var_1_9=1] [L52] COND TRUE var_1_10 || var_1_9 [L53] var_1_11 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=126, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=31, var_1_17=-2, var_1_7=0, var_1_9=1] [L57] COND FALSE !(var_1_6 > var_1_5) VAL [isInitial=1, var_1_10=0, var_1_11=126, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=31, var_1_17=-2, var_1_7=0, var_1_9=1] [L111] RET step() [L112] CALL, EXPR property() [L102-L103] return ((((var_1_2 != var_1_3) ? (var_1_1 == ((double) ((var_1_4 - var_1_5) - var_1_6))) : 1) && ((var_1_5 > (var_1_1 / var_1_4)) ? ((var_1_5 > (var_1_4 / var_1_8)) ? (var_1_7 == ((unsigned char) var_1_9)) : (var_1_7 == ((unsigned char) var_1_10))) : 1)) && ((var_1_10 || var_1_9) ? (var_1_11 == ((signed char) var_1_12)) : (var_1_11 == ((signed char) (((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))) + (var_1_15 + var_1_16)))))) && ((var_1_6 > var_1_5) ? ((var_1_1 != (var_1_4 / var_1_8)) ? (var_1_17 == ((signed long int) var_1_16)) : 1) : 1) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=126, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=31, var_1_17=-2, var_1_7=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=126, var_1_12=126, var_1_13=-1, var_1_14=-2, var_1_15=-31, var_1_16=31, var_1_17=-2, var_1_7=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 102 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 21, 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, 77 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, 77 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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, 381 NumberOfCodeBlocks, 381 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 252 SizeOfPredicates, 0 NumberOfNonLiveVariables, 284 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1640/1680 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-17 03:45:36,172 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-94.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 ddc0508a464e42fc1f87097589b784a1207a6851d9973aeaa08029fac2a2578e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:45:38,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:45:38,221 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:45:38,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:45:38,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:45:38,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:45:38,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:45:38,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:45:38,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:45:38,254 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:45:38,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:45:38,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:45:38,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:45:38,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:45:38,255 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:45:38,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:45:38,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:45:38,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:45:38,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:45:38,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:45:38,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:45:38,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:45:38,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:45:38,255 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:45:38,255 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:45:38,255 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:45:38,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:45:38,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:45:38,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:45:38,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:45:38,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:45:38,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:45:38,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:45:38,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:45:38,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:45:38,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:45:38,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:45:38,256 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:45:38,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:45:38,256 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:45:38,256 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:45:38,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:45:38,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:45:38,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:45:38,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:45:38,259 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 -> ddc0508a464e42fc1f87097589b784a1207a6851d9973aeaa08029fac2a2578e [2025-03-17 03:45:38,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:45:38,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:45:38,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:45:38,595 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:45:38,595 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:45:38,596 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-94.i [2025-03-17 03:45:39,825 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47ef6000/bcd4456a6e61427796f8875c622eae67/FLAG274561237 [2025-03-17 03:45:39,997 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:45:39,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-94.i [2025-03-17 03:45:40,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47ef6000/bcd4456a6e61427796f8875c622eae67/FLAG274561237 [2025-03-17 03:45:40,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47ef6000/bcd4456a6e61427796f8875c622eae67 [2025-03-17 03:45:40,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:45:40,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:45:40,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:45:40,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:45:40,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:45:40,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:45:40" (1/1) ... [2025-03-17 03:45:40,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ab6e30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:40, skipping insertion in model container [2025-03-17 03:45:40,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:45:40" (1/1) ... [2025-03-17 03:45:40,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:45:40,164 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-94.i[915,928] [2025-03-17 03:45:40,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:45:40,222 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:45:40,231 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-94.i[915,928] [2025-03-17 03:45:40,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:45:40,256 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:45:40,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:40 WrapperNode [2025-03-17 03:45:40,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:45:40,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:45:40,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:45:40,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:45:40,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:40" (1/1) ... [2025-03-17 03:45:40,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:40" (1/1) ... [2025-03-17 03:45:40,287 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-03-17 03:45:40,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:45:40,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:45:40,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:45:40,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:45:40,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:40" (1/1) ... [2025-03-17 03:45:40,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:40" (1/1) ... [2025-03-17 03:45:40,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:40" (1/1) ... [2025-03-17 03:45:40,307 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-17 03:45:40,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:40" (1/1) ... [2025-03-17 03:45:40,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:40" (1/1) ... [2025-03-17 03:45:40,315 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:40" (1/1) ... [2025-03-17 03:45:40,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:40" (1/1) ... [2025-03-17 03:45:40,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:40" (1/1) ... [2025-03-17 03:45:40,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:40" (1/1) ... [2025-03-17 03:45:40,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:45:40,320 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:45:40,320 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:45:40,320 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:45:40,320 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:40" (1/1) ... [2025-03-17 03:45:40,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:45:40,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:45:40,343 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-17 03:45:40,347 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-17 03:45:40,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:45:40,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:45:40,365 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:45:40,365 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:45:40,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:45:40,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:45:40,427 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:45:40,428 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:46:03,597 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 03:46:03,599 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:46:03,609 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:46:03,610 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:46:03,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:46:03 BoogieIcfgContainer [2025-03-17 03:46:03,610 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:46:03,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:46:03,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:46:03,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:46:03,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:45:40" (1/3) ... [2025-03-17 03:46:03,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1990dcfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:46:03, skipping insertion in model container [2025-03-17 03:46:03,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:40" (2/3) ... [2025-03-17 03:46:03,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1990dcfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:46:03, skipping insertion in model container [2025-03-17 03:46:03,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:46:03" (3/3) ... [2025-03-17 03:46:03,617 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-94.i [2025-03-17 03:46:03,627 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:46:03,629 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-94.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:46:03,673 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:46:03,681 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;@23cdf9e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:46:03,682 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:46:03,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 03:46:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 03:46:03,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:46:03,692 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:46:03,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:46:03,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:46:03,696 INFO L85 PathProgramCache]: Analyzing trace with hash 259036924, now seen corresponding path program 1 times [2025-03-17 03:46:03,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:46:03,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321078861] [2025-03-17 03:46:03,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:46:03,704 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-17 03:46:03,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:46:03,707 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-17 03:46:03,708 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-17 03:46:03,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 03:46:05,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 03:46:05,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:46:05,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:46:05,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:46:05,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:46:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-17 03:46:05,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:46:05,124 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:46:05,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321078861] [2025-03-17 03:46:05,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321078861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:46:05,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:46:05,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:46:05,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874037702] [2025-03-17 03:46:05,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:46:05,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:46:05,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:46:05,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:46:05,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:46:05,160 INFO L87 Difference]: Start difference. First operand has 53 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 03:46:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:46:05,178 INFO L93 Difference]: Finished difference Result 103 states and 181 transitions. [2025-03-17 03:46:05,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:46:05,180 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 127 [2025-03-17 03:46:05,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:46:05,185 INFO L225 Difference]: With dead ends: 103 [2025-03-17 03:46:05,185 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 03:46:05,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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-17 03:46:05,192 INFO L435 NwaCegarLoop]: 77 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, 77 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-17 03:46:05,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:46:05,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 03:46:05,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 03:46:05,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 03:46:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 77 transitions. [2025-03-17 03:46:05,226 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 77 transitions. Word has length 127 [2025-03-17 03:46:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:46:05,226 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 77 transitions. [2025-03-17 03:46:05,229 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 03:46:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 77 transitions. [2025-03-17 03:46:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 03:46:05,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:46:05,233 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:46:05,264 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-17 03:46:05,433 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-17 03:46:05,434 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:46:05,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:46:05,434 INFO L85 PathProgramCache]: Analyzing trace with hash 857665089, now seen corresponding path program 1 times [2025-03-17 03:46:05,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:46:05,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571558394] [2025-03-17 03:46:05,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:46:05,435 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-17 03:46:05,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:46:05,437 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-17 03:46:05,438 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-17 03:46:05,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 03:46:07,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 03:46:07,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:46:07,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:46:07,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 03:46:07,149 INFO L279 TraceCheckSpWp]: Computing forward predicates...