./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-23.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 f462d80663b78a29790b023038a77faf5713782a583a5f5f0d8b8d3fab1b2d32 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:40:49,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:40:49,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:40:49,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:40:49,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:40:49,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:40:49,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:40:49,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:40:49,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:40:49,700 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:40:49,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:40:49,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:40:49,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:40:49,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:40:49,701 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:40:49,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:40:49,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:40:49,702 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:40:49,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:40:49,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:40:49,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:40:49,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:40:49,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:40:49,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:40:49,702 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:40:49,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:40:49,702 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:40:49,702 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:40:49,702 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:40:49,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:40:49,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:40:49,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:40:49,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:40:49,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:40:49,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:40:49,703 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:40:49,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:40:49,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:40:49,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:40:49,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:40:49,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:40:49,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:40:49,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:40:49,704 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 -> f462d80663b78a29790b023038a77faf5713782a583a5f5f0d8b8d3fab1b2d32 [2025-03-08 14:40:49,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:40:49,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:40:49,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:40:49,953 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:40:49,953 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:40:49,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-23.i [2025-03-08 14:40:51,168 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5d46d35/c17891a3d4344313968ba3404fecc713/FLAGc8a3564d3 [2025-03-08 14:40:51,394 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:40:51,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-23.i [2025-03-08 14:40:51,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5d46d35/c17891a3d4344313968ba3404fecc713/FLAGc8a3564d3 [2025-03-08 14:40:51,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5d46d35/c17891a3d4344313968ba3404fecc713 [2025-03-08 14:40:51,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:40:51,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:40:51,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:40:51,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:40:51,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:40:51,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:40:51" (1/1) ... [2025-03-08 14:40:51,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6969ebf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:51, skipping insertion in model container [2025-03-08 14:40:51,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:40:51" (1/1) ... [2025-03-08 14:40:51,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:40:51,571 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_50-1loop_file-23.i[915,928] [2025-03-08 14:40:51,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:40:51,655 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:40:51,664 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_50-1loop_file-23.i[915,928] [2025-03-08 14:40:51,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:40:51,714 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:40:51,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:51 WrapperNode [2025-03-08 14:40:51,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:40:51,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:40:51,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:40:51,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:40:51,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:51" (1/1) ... [2025-03-08 14:40:51,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:51" (1/1) ... [2025-03-08 14:40:51,754 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2025-03-08 14:40:51,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:40:51,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:40:51,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:40:51,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:40:51,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:51" (1/1) ... [2025-03-08 14:40:51,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:51" (1/1) ... [2025-03-08 14:40:51,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:51" (1/1) ... [2025-03-08 14:40:51,776 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:40:51,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:51" (1/1) ... [2025-03-08 14:40:51,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:51" (1/1) ... [2025-03-08 14:40:51,782 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:51" (1/1) ... [2025-03-08 14:40:51,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:51" (1/1) ... [2025-03-08 14:40:51,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:51" (1/1) ... [2025-03-08 14:40:51,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:51" (1/1) ... [2025-03-08 14:40:51,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:40:51,792 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:40:51,792 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:40:51,793 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:40:51,793 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:51" (1/1) ... [2025-03-08 14:40:51,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:40:51,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:40:51,823 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:40:51,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:40:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:40:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:40:51,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:40:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:40:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:40:51,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:40:51,909 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:40:51,911 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:40:52,248 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-08 14:40:52,249 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:40:52,262 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:40:52,264 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:40:52,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:40:52 BoogieIcfgContainer [2025-03-08 14:40:52,265 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:40:52,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:40:52,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:40:52,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:40:52,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:40:51" (1/3) ... [2025-03-08 14:40:52,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22be5d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:40:52, skipping insertion in model container [2025-03-08 14:40:52,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:51" (2/3) ... [2025-03-08 14:40:52,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22be5d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:40:52, skipping insertion in model container [2025-03-08 14:40:52,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:40:52" (3/3) ... [2025-03-08 14:40:52,275 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-23.i [2025-03-08 14:40:52,289 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:40:52,290 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-23.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:40:52,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:40:52,347 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;@2a6b22f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:40:52,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:40:52,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 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-08 14:40:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 14:40:52,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:40:52,360 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:40:52,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:40:52,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:40:52,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1772052848, now seen corresponding path program 1 times [2025-03-08 14:40:52,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:40:52,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269030379] [2025-03-08 14:40:52,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:40:52,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:40:52,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 14:40:52,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 14:40:52,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:40:52,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:40:52,653 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-08 14:40:52,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:40:52,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269030379] [2025-03-08 14:40:52,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269030379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:40:52,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051041327] [2025-03-08 14:40:52,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:40:52,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:40:52,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:40:52,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:40:52,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:40:52,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 14:40:52,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 14:40:52,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:40:52,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:40:52,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:40:52,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:40:52,857 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-08 14:40:52,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:40:52,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051041327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:40:52,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:40:52,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:40:52,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424449470] [2025-03-08 14:40:52,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:40:52,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:40:52,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:40:52,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:40:52,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:40:52,879 INFO L87 Difference]: Start difference. First operand has 64 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-08 14:40:52,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:40:52,898 INFO L93 Difference]: Finished difference Result 125 states and 210 transitions. [2025-03-08 14:40:52,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:40:52,900 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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 135 [2025-03-08 14:40:52,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:40:52,906 INFO L225 Difference]: With dead ends: 125 [2025-03-08 14:40:52,906 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 14:40:52,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:40:52,913 INFO L435 NwaCegarLoop]: 94 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, 94 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:40:52,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:40:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 14:40:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-08 14:40:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 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-08 14:40:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 91 transitions. [2025-03-08 14:40:52,947 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 91 transitions. Word has length 135 [2025-03-08 14:40:52,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:40:52,948 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 91 transitions. [2025-03-08 14:40:52,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-08 14:40:52,948 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2025-03-08 14:40:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 14:40:52,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:40:52,950 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:40:52,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 14:40:53,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:40:53,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:40:53,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:40:53,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1344558633, now seen corresponding path program 1 times [2025-03-08 14:40:53,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:40:53,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67434570] [2025-03-08 14:40:53,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:40:53,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:40:53,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 14:40:53,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 14:40:53,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:40:53,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:40:53,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2087298625] [2025-03-08 14:40:53,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:40:53,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:40:53,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:40:53,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:40:53,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 14:40:53,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 14:40:53,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 14:40:53,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:40:53,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:40:53,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 14:40:53,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:40:54,724 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 462 proven. 21 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2025-03-08 14:40:54,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:41:09,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:41:09,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67434570] [2025-03-08 14:41:09,025 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:41:09,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087298625] [2025-03-08 14:41:09,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087298625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:41:09,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:41:09,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2025-03-08 14:41:09,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504588694] [2025-03-08 14:41:09,026 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 14:41:09,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 14:41:09,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:41:09,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 14:41:09,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2025-03-08 14:41:09,028 INFO L87 Difference]: Start difference. First operand 61 states and 91 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-08 14:41:10,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:41:10,745 INFO L93 Difference]: Finished difference Result 213 states and 305 transitions. [2025-03-08 14:41:10,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 14:41:10,746 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) Word has length 135 [2025-03-08 14:41:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:41:10,748 INFO L225 Difference]: With dead ends: 213 [2025-03-08 14:41:10,748 INFO L226 Difference]: Without dead ends: 155 [2025-03-08 14:41:10,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=578, Invalid=1678, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 14:41:10,750 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 192 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 14:41:10,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 597 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 14:41:10,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-08 14:41:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 127. [2025-03-08 14:41:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 78 states have internal predecessors, (96), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 14:41:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 180 transitions. [2025-03-08 14:41:10,775 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 180 transitions. Word has length 135 [2025-03-08 14:41:10,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:41:10,775 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 180 transitions. [2025-03-08 14:41:10,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-08 14:41:10,775 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 180 transitions. [2025-03-08 14:41:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 14:41:10,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:41:10,777 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:41:10,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 14:41:10,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 14:41:10,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:41:10,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:41:10,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1345482154, now seen corresponding path program 1 times [2025-03-08 14:41:10,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:41:10,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770822907] [2025-03-08 14:41:10,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:41:10,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:41:10,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 14:41:11,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 14:41:11,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:41:11,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:41:11,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905084951] [2025-03-08 14:41:11,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:41:11,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:41:11,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:41:11,088 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:41:11,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 14:41:11,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 14:41:11,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 14:41:11,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:41:11,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:41:11,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:41:11,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 14:41:11,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 14:41:11,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:41:11,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:41:11,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:41:11,384 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:41:11,386 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:41:11,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 14:41:11,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:41:11,590 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 14:41:11,666 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:41:11,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:41:11 BoogieIcfgContainer [2025-03-08 14:41:11,668 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:41:11,669 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:41:11,669 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:41:11,669 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:41:11,669 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:40:52" (3/4) ... [2025-03-08 14:41:11,671 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:41:11,671 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:41:11,672 INFO L158 Benchmark]: Toolchain (without parser) took 20247.70ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 113.7MB in the beginning and 245.3MB in the end (delta: -131.6MB). Peak memory consumption was 148.7MB. Max. memory is 16.1GB. [2025-03-08 14:41:11,672 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:41:11,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.83ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 99.4MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:41:11,673 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.23ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 95.8MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:41:11,673 INFO L158 Benchmark]: Boogie Preprocessor took 32.23ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 90.4MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:41:11,673 INFO L158 Benchmark]: IcfgBuilder took 473.99ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 66.4MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 14:41:11,673 INFO L158 Benchmark]: TraceAbstraction took 19399.77ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 65.9MB in the beginning and 248.5MB in the end (delta: -182.6MB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. [2025-03-08 14:41:11,673 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 427.8MB. Free memory was 248.5MB in the beginning and 245.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:41:11,674 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.23ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.83ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 99.4MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.23ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 95.8MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.23ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 90.4MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 473.99ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 66.4MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19399.77ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 65.9MB in the beginning and 248.5MB in the end (delta: -182.6MB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 427.8MB. Free memory was 248.5MB in the beginning and 245.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someUnaryDOUBLEoperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 66. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 1.4; [L26] float var_1_7 = 9.25; [L27] float var_1_8 = 1.2; [L28] float var_1_9 = 0.0; [L29] float var_1_10 = 3.1; [L30] float var_1_11 = 500.5; [L31] signed long int var_1_12 = 0; [L32] unsigned char var_1_13 = 10; [L33] unsigned char var_1_14 = 8; [L34] unsigned char var_1_17 = 64; [L35] unsigned long int var_1_18 = 25; [L36] signed char var_1_19 = -100; [L37] signed short int var_1_20 = -4; [L38] unsigned short int var_1_21 = 200; [L39] unsigned short int var_1_22 = 54878; [L40] double var_1_23 = 9999.8; [L41] float var_1_24 = -0.25; [L42] signed char var_1_25 = 50; [L43] signed char last_1_var_1_19 = -100; VAL [isInitial=0, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L139] isInitial = 1 [L140] FCALL initially() [L141] int k_loop; [L142] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L142] COND TRUE k_loop < 1 [L143] CALL updateLastVariables() [L132] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L143] RET updateLastVariables() [L144] CALL updateVariables() [L97] var_1_2 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L98] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L99] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L100] var_1_3 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L101] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L102] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L103] var_1_7 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_8=6/5, var_1_9=0] [L104] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_8=6/5, var_1_9=0] [L105] var_1_8 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_9=0] [L106] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_9=0] [L107] var_1_9 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_9 >= 4611686.018427382800e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L108] RET assume_abort_if_not((var_1_9 >= 4611686.018427382800e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L109] var_1_10 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L110] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L111] var_1_11 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L112] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L113] var_1_13 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L114] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L115] CALL assume_abort_if_not(var_1_13 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L115] RET assume_abort_if_not(var_1_13 <= 64) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L116] var_1_14 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L117] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L118] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L118] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L119] var_1_17 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L120] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L121] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L121] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L122] CALL assume_abort_if_not(var_1_17 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L122] RET assume_abort_if_not(var_1_17 != 127) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L123] var_1_20 = __VERIFIER_nondet_short() [L124] CALL assume_abort_if_not(var_1_20 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L124] RET assume_abort_if_not(var_1_20 >= -32768) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L125] CALL assume_abort_if_not(var_1_20 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L125] RET assume_abort_if_not(var_1_20 <= 32767) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L126] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L126] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L127] var_1_22 = __VERIFIER_nondet_ushort() [L128] CALL assume_abort_if_not(var_1_22 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=200, var_1_22=98397, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=200, var_1_22=98397, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L128] RET assume_abort_if_not(var_1_22 >= 32767) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=200, var_1_22=98397, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L129] CALL assume_abort_if_not(var_1_22 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=200, var_1_22=98397, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=200, var_1_22=98397, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L129] RET assume_abort_if_not(var_1_22 <= 65534) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=200, var_1_22=98397, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L144] RET updateVariables() [L145] CALL step() [L47] COND TRUE \read(var_1_2) [L48] var_1_1 = var_1_3 VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=200, var_1_22=98397, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L50] signed long int stepLocal_4 = 5; VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_4=5, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=200, var_1_22=98397, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L51] COND TRUE stepLocal_4 <= var_1_17 [L52] var_1_21 = (var_1_22 - var_1_17) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=32738, var_1_22=98397, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L62] var_1_23 = var_1_10 [L63] var_1_24 = 31.75f [L64] var_1_25 = -5 [L65] unsigned char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_0=0, var_1_10=2, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=32738, var_1_22=98397, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=7/5] [L66] COND TRUE (var_1_23 <= var_1_23) || stepLocal_0 [L67] var_1_4 = ((((31.5f) > (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (31.5f) : (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))))) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=32738, var_1_22=98397, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L71] signed long int stepLocal_3 = (200 - var_1_13) - var_1_14; [L72] unsigned char stepLocal_2 = var_1_13; [L73] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=0, stepLocal_2=0, stepLocal_3=200, var_1_10=2, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=32738, var_1_22=98397, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L74] COND TRUE stepLocal_3 != var_1_25 [L75] var_1_12 = (var_1_13 + ((((var_1_14) < (var_1_21)) ? (var_1_14) : (var_1_21)))) VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=0, stepLocal_2=0, var_1_10=2, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=32738, var_1_22=98397, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L87] COND TRUE (- (var_1_13 / var_1_17)) > var_1_25 [L88] var_1_18 = var_1_13 VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=0, stepLocal_2=0, var_1_10=2, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=0, var_1_19=-100, var_1_1=0, var_1_20=3, var_1_21=32738, var_1_22=98397, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L90] COND FALSE !((last_1_var_1_19 / ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20)))) > var_1_21) [L93] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=0, stepLocal_2=0, var_1_10=2, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=0, var_1_19=123, var_1_1=0, var_1_20=3, var_1_21=32738, var_1_22=98397, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L145] RET step() [L146] CALL, EXPR property() [L135-L136] return ((((((((var_1_2 ? (var_1_1 == ((unsigned char) var_1_3)) : 1) && (((var_1_23 <= var_1_23) || var_1_1) ? (var_1_4 == ((float) ((((31.5f) > (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (31.5f) : (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))))))) : (var_1_4 == ((float) ((var_1_9 - var_1_10) - var_1_11))))) && ((((200 - var_1_13) - var_1_14) != var_1_25) ? (var_1_12 == ((signed long int) (var_1_13 + ((((var_1_14) < (var_1_21)) ? (var_1_14) : (var_1_21)))))) : (((var_1_25 / (128 - var_1_17)) < var_1_13) ? ((var_1_13 >= var_1_25) ? (var_1_12 == ((signed long int) var_1_14)) : (var_1_12 == ((signed long int) var_1_17))) : (var_1_12 == ((signed long int) var_1_17))))) && (((- (var_1_13 / var_1_17)) > var_1_25) ? (var_1_18 == ((unsigned long int) var_1_13)) : 1)) && (((last_1_var_1_19 / ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20)))) > var_1_21) ? (var_1_19 == ((signed char) ((((var_1_17) > (var_1_13)) ? (var_1_17) : (var_1_13))))) : (var_1_19 == ((signed char) var_1_17)))) && ((5 <= var_1_17) ? (var_1_21 == ((unsigned short int) (var_1_22 - var_1_17))) : (var_1_1 ? (var_1_1 ? (var_1_21 == ((unsigned short int) var_1_17)) : (var_1_21 == ((unsigned short int) var_1_17))) : 1))) && (var_1_23 == ((double) var_1_10))) && (var_1_24 == ((float) 31.75f))) && (var_1_25 == ((signed char) -5)) ; VAL [\result=0, isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=0, var_1_19=123, var_1_1=0, var_1_20=3, var_1_21=32738, var_1_22=98397, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=0, var_1_19=123, var_1_1=0, var_1_20=3, var_1_21=32738, var_1_22=98397, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=0, var_1_13=0, var_1_14=256, var_1_17=123, var_1_18=0, var_1_19=123, var_1_1=0, var_1_20=3, var_1_21=32738, var_1_22=98397, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 117 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 192 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 192 mSDsluCounter, 691 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 542 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 553 IncrementalHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 149 mSDtfsCounter, 553 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=2, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 28 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 810 NumberOfCodeBlocks, 810 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 402 ConstructedInterpolants, 0 QuantifiedInterpolants, 1501 SizeOfPredicates, 7 NumberOfNonLiveVariables, 644 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 2459/2520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:41:11,713 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_50-1loop_file-23.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 f462d80663b78a29790b023038a77faf5713782a583a5f5f0d8b8d3fab1b2d32 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:41:13,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:41:13,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:41:13,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:41:13,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:41:13,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:41:13,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:41:13,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:41:13,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:41:13,578 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:41:13,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:41:13,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:41:13,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:41:13,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:41:13,579 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:41:13,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:41:13,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:41:13,579 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:41:13,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:41:13,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:41:13,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:41:13,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:41:13,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:41:13,580 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:41:13,580 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:41:13,580 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:41:13,580 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:41:13,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:41:13,580 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:41:13,580 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:41:13,580 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:41:13,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:41:13,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:41:13,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:41:13,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:41:13,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:41:13,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:41:13,581 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:41:13,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:41:13,581 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:41:13,581 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:41:13,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:41:13,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:41:13,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:41:13,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:41:13,581 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 -> f462d80663b78a29790b023038a77faf5713782a583a5f5f0d8b8d3fab1b2d32 [2025-03-08 14:41:13,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:41:13,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:41:13,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:41:13,813 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:41:13,813 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:41:13,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-23.i [2025-03-08 14:41:15,030 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1f6f8fd8/784b7be1c804461cb6fb25c594870664/FLAGa87ef9483 [2025-03-08 14:41:15,196 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:41:15,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-23.i [2025-03-08 14:41:15,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1f6f8fd8/784b7be1c804461cb6fb25c594870664/FLAGa87ef9483 [2025-03-08 14:41:15,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1f6f8fd8/784b7be1c804461cb6fb25c594870664 [2025-03-08 14:41:15,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:41:15,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:41:15,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:41:15,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:41:15,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:41:15,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:41:15" (1/1) ... [2025-03-08 14:41:15,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@503394c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:41:15, skipping insertion in model container [2025-03-08 14:41:15,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:41:15" (1/1) ... [2025-03-08 14:41:15,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:41:15,352 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_50-1loop_file-23.i[915,928] [2025-03-08 14:41:15,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:41:15,428 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:41:15,436 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_50-1loop_file-23.i[915,928] [2025-03-08 14:41:15,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:41:15,480 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:41:15,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:41:15 WrapperNode [2025-03-08 14:41:15,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:41:15,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:41:15,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:41:15,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:41:15,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:41:15" (1/1) ... [2025-03-08 14:41:15,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:41:15" (1/1) ... [2025-03-08 14:41:15,523 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-03-08 14:41:15,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:41:15,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:41:15,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:41:15,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:41:15,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:41:15" (1/1) ... [2025-03-08 14:41:15,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:41:15" (1/1) ... [2025-03-08 14:41:15,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:41:15" (1/1) ... [2025-03-08 14:41:15,557 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:41:15,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:41:15" (1/1) ... [2025-03-08 14:41:15,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:41:15" (1/1) ... [2025-03-08 14:41:15,567 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:41:15" (1/1) ... [2025-03-08 14:41:15,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:41:15" (1/1) ... [2025-03-08 14:41:15,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:41:15" (1/1) ... [2025-03-08 14:41:15,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:41:15" (1/1) ... [2025-03-08 14:41:15,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:41:15,577 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:41:15,577 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:41:15,577 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:41:15,578 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:41:15" (1/1) ... [2025-03-08 14:41:15,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:41:15,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:41:15,608 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:41:15,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:41:15,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:41:15,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:41:15,627 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:41:15,627 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:41:15,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:41:15,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:41:15,689 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:41:15,692 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:41:16,892 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-08 14:41:16,892 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:41:16,898 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:41:16,898 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:41:16,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:41:16 BoogieIcfgContainer [2025-03-08 14:41:16,899 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:41:16,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:41:16,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:41:16,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:41:16,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:41:15" (1/3) ... [2025-03-08 14:41:16,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dea8704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:41:16, skipping insertion in model container [2025-03-08 14:41:16,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:41:15" (2/3) ... [2025-03-08 14:41:16,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dea8704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:41:16, skipping insertion in model container [2025-03-08 14:41:16,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:41:16" (3/3) ... [2025-03-08 14:41:16,907 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-23.i [2025-03-08 14:41:16,918 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:41:16,919 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-23.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:41:16,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:41:16,968 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;@4fe6f109, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:41:16,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:41:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 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-08 14:41:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 14:41:16,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:41:16,980 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:41:16,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:41:16,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:41:16,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1772052848, now seen corresponding path program 1 times [2025-03-08 14:41:16,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:41:16,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665923213] [2025-03-08 14:41:16,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:41:16,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:41:16,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:41:16,994 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:41:16,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:41:17,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 14:41:17,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 14:41:17,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:41:17,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:41:17,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:41:17,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:41:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2025-03-08 14:41:17,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:41:17,353 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:41:17,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665923213] [2025-03-08 14:41:17,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665923213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:41:17,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:41:17,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:41:17,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567331791] [2025-03-08 14:41:17,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:41:17,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:41:17,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:41:17,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:41:17,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:41:17,373 INFO L87 Difference]: Start difference. First operand has 64 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 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 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-08 14:41:17,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:41:17,388 INFO L93 Difference]: Finished difference Result 125 states and 210 transitions. [2025-03-08 14:41:17,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:41:17,391 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 135 [2025-03-08 14:41:17,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:41:17,395 INFO L225 Difference]: With dead ends: 125 [2025-03-08 14:41:17,396 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 14:41:17,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:41:17,402 INFO L435 NwaCegarLoop]: 94 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, 94 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:41:17,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:41:17,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 14:41:17,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-08 14:41:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 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-08 14:41:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 91 transitions. [2025-03-08 14:41:17,430 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 91 transitions. Word has length 135 [2025-03-08 14:41:17,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:41:17,430 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 91 transitions. [2025-03-08 14:41:17,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-08 14:41:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2025-03-08 14:41:17,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 14:41:17,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:41:17,434 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:41:17,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 14:41:17,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:41:17,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:41:17,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:41:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1344558633, now seen corresponding path program 1 times [2025-03-08 14:41:17,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:41:17,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218729995] [2025-03-08 14:41:17,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:41:17,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:41:17,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:41:17,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:41:17,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:41:17,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 14:41:17,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 14:41:17,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:41:17,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:41:17,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 14:41:17,915 INFO L279 TraceCheckSpWp]: Computing forward predicates...