./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.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 046e4169d322167d7576c9c2b9007e1beb6aeeec9394209bc254f3d13fdc20dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:10:22,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:10:23,021 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:10:23,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:10:23,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:10:23,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:10:23,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:10:23,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:10:23,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:10:23,054 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:10:23,055 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:10:23,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:10:23,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:10:23,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:10:23,056 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:10:23,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:10:23,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:10:23,056 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:10:23,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:10:23,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:10:23,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:10:23,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:10:23,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:10:23,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:10:23,057 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:10:23,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:10:23,057 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:10:23,057 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:10:23,057 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:10:23,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:10:23,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:10:23,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:10:23,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:10:23,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:10:23,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:10:23,058 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:10:23,058 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:10:23,058 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:10:23,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:10:23,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:10:23,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:10:23,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:10:23,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:10:23,059 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 -> 046e4169d322167d7576c9c2b9007e1beb6aeeec9394209bc254f3d13fdc20dd [2025-03-17 03:10:23,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:10:23,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:10:23,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:10:23,276 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:10:23,277 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:10:23,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i [2025-03-17 03:10:24,434 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/987e54ed1/5eab23b4505b4f4bb11d716da0ab2e71/FLAGab6922112 [2025-03-17 03:10:24,660 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:10:24,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i [2025-03-17 03:10:24,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/987e54ed1/5eab23b4505b4f4bb11d716da0ab2e71/FLAGab6922112 [2025-03-17 03:10:25,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/987e54ed1/5eab23b4505b4f4bb11d716da0ab2e71 [2025-03-17 03:10:25,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:10:25,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:10:25,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:10:25,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:10:25,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:10:25,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:10:25" (1/1) ... [2025-03-17 03:10:25,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4ae29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:25, skipping insertion in model container [2025-03-17 03:10:25,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:10:25" (1/1) ... [2025-03-17 03:10:25,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:10:25,134 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_100-1loop_file-84.i[916,929] [2025-03-17 03:10:25,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:10:25,228 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:10:25,238 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_100-1loop_file-84.i[916,929] [2025-03-17 03:10:25,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:10:25,281 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:10:25,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:25 WrapperNode [2025-03-17 03:10:25,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:10:25,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:10:25,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:10:25,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:10:25,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:25" (1/1) ... [2025-03-17 03:10:25,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:25" (1/1) ... [2025-03-17 03:10:25,329 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2025-03-17 03:10:25,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:10:25,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:10:25,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:10:25,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:10:25,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:25" (1/1) ... [2025-03-17 03:10:25,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:25" (1/1) ... [2025-03-17 03:10:25,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:25" (1/1) ... [2025-03-17 03:10:25,364 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:10:25,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:25" (1/1) ... [2025-03-17 03:10:25,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:25" (1/1) ... [2025-03-17 03:10:25,380 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:25" (1/1) ... [2025-03-17 03:10:25,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:25" (1/1) ... [2025-03-17 03:10:25,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:25" (1/1) ... [2025-03-17 03:10:25,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:25" (1/1) ... [2025-03-17 03:10:25,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:10:25,396 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:10:25,397 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:10:25,397 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:10:25,398 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:25" (1/1) ... [2025-03-17 03:10:25,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:10:25,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:10:25,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:10:25,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:10:25,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:10:25,442 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:10:25,442 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:10:25,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:10:25,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:10:25,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:10:25,506 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:10:25,507 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:10:25,799 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-17 03:10:25,800 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:10:25,810 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:10:25,810 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:10:25,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:10:25 BoogieIcfgContainer [2025-03-17 03:10:25,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:10:25,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:10:25,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:10:25,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:10:25,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:10:25" (1/3) ... [2025-03-17 03:10:25,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dac9441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:10:25, skipping insertion in model container [2025-03-17 03:10:25,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:25" (2/3) ... [2025-03-17 03:10:25,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dac9441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:10:25, skipping insertion in model container [2025-03-17 03:10:25,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:10:25" (3/3) ... [2025-03-17 03:10:25,818 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-84.i [2025-03-17 03:10:25,828 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:10:25,829 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-84.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:10:25,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:10:25,881 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;@7ce5edfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:10:25,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:10:25,885 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 49 states have internal predecessors, (70), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 03:10:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 03:10:25,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:25,895 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:10:25,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:25,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:25,899 INFO L85 PathProgramCache]: Analyzing trace with hash 150458967, now seen corresponding path program 1 times [2025-03-17 03:10:25,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:10:25,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19752607] [2025-03-17 03:10:25,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:25,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:10:25,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 03:10:26,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 03:10:26,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:26,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-17 03:10:26,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:10:26,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19752607] [2025-03-17 03:10:26,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19752607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:10:26,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944925108] [2025-03-17 03:10:26,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:26,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:10:26,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:10:26,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:10:26,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:10:26,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 03:10:26,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 03:10:26,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:26,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:26,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:10:26,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:10:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-17 03:10:26,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:10:26,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944925108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:10:26,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:10:26,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:10:26,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006079857] [2025-03-17 03:10:26,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:10:26,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:10:26,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:10:26,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:10:26,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:10:26,406 INFO L87 Difference]: Start difference. First operand has 74 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 49 states have internal predecessors, (70), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 03:10:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:10:26,428 INFO L93 Difference]: Finished difference Result 147 states and 254 transitions. [2025-03-17 03:10:26,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:10:26,431 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2025-03-17 03:10:26,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:10:26,436 INFO L225 Difference]: With dead ends: 147 [2025-03-17 03:10:26,437 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 03:10:26,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:10:26,443 INFO L435 NwaCegarLoop]: 113 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, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:10:26,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:10:26,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 03:10:26,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-17 03:10:26,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 03:10:26,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 111 transitions. [2025-03-17 03:10:26,485 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 111 transitions. Word has length 150 [2025-03-17 03:10:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:10:26,485 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 111 transitions. [2025-03-17 03:10:26,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 03:10:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 111 transitions. [2025-03-17 03:10:26,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 03:10:26,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:26,488 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:10:26,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:10:26,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:10:26,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:26,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:26,691 INFO L85 PathProgramCache]: Analyzing trace with hash 723597556, now seen corresponding path program 1 times [2025-03-17 03:10:26,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:10:26,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86176220] [2025-03-17 03:10:26,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:26,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:10:26,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 03:10:26,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 03:10:26,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:26,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 03:10:26,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:10:26,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86176220] [2025-03-17 03:10:26,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86176220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:10:26,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:10:26,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:10:26,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80758627] [2025-03-17 03:10:26,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:10:26,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:10:26,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:10:26,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:10:26,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:10:26,945 INFO L87 Difference]: Start difference. First operand 72 states and 111 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 03:10:26,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:10:26,988 INFO L93 Difference]: Finished difference Result 178 states and 271 transitions. [2025-03-17 03:10:26,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:10:26,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2025-03-17 03:10:26,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:10:26,990 INFO L225 Difference]: With dead ends: 178 [2025-03-17 03:10:26,990 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 03:10:26,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:10:26,991 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 44 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:10:26,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 235 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:10:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 03:10:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2025-03-17 03:10:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 71 states have internal predecessors, (96), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 03:10:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 158 transitions. [2025-03-17 03:10:27,007 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 158 transitions. Word has length 150 [2025-03-17 03:10:27,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:10:27,008 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 158 transitions. [2025-03-17 03:10:27,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 03:10:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 158 transitions. [2025-03-17 03:10:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 03:10:27,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:27,009 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:10:27,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:10:27,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:27,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:27,011 INFO L85 PathProgramCache]: Analyzing trace with hash 752226707, now seen corresponding path program 1 times [2025-03-17 03:10:27,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:10:27,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486330646] [2025-03-17 03:10:27,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:27,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:10:27,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 03:10:27,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 03:10:27,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:27,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 03:10:27,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:10:27,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486330646] [2025-03-17 03:10:27,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486330646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:10:27,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:10:27,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:10:27,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296920487] [2025-03-17 03:10:27,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:10:27,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:10:27,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:10:27,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:10:27,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:10:27,454 INFO L87 Difference]: Start difference. First operand 104 states and 158 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 03:10:27,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:10:27,518 INFO L93 Difference]: Finished difference Result 209 states and 316 transitions. [2025-03-17 03:10:27,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:10:27,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2025-03-17 03:10:27,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:10:27,520 INFO L225 Difference]: With dead ends: 209 [2025-03-17 03:10:27,520 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 03:10:27,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:10:27,525 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 44 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:10:27,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 368 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:10:27,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 03:10:27,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2025-03-17 03:10:27,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 70 states have internal predecessors, (94), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 03:10:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 156 transitions. [2025-03-17 03:10:27,543 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 156 transitions. Word has length 150 [2025-03-17 03:10:27,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:10:27,544 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 156 transitions. [2025-03-17 03:10:27,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 03:10:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 156 transitions. [2025-03-17 03:10:27,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 03:10:27,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:27,545 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:10:27,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:10:27,547 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:27,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1725617841, now seen corresponding path program 1 times [2025-03-17 03:10:27,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:10:27,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035381116] [2025-03-17 03:10:27,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:27,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:10:27,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 03:10:27,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 03:10:27,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:27,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 03:10:28,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:10:28,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035381116] [2025-03-17 03:10:28,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035381116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:10:28,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:10:28,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:10:28,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003932293] [2025-03-17 03:10:28,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:10:28,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:10:28,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:10:28,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:10:28,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:10:28,283 INFO L87 Difference]: Start difference. First operand 103 states and 156 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 03:10:28,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:10:28,849 INFO L93 Difference]: Finished difference Result 471 states and 710 transitions. [2025-03-17 03:10:28,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:10:28,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2025-03-17 03:10:28,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:10:28,857 INFO L225 Difference]: With dead ends: 471 [2025-03-17 03:10:28,858 INFO L226 Difference]: Without dead ends: 369 [2025-03-17 03:10:28,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:10:28,864 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 261 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:10:28,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 528 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:10:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-17 03:10:28,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 213. [2025-03-17 03:10:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 146 states have (on average 1.3835616438356164) internal successors, (202), 148 states have internal predecessors, (202), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 03:10:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 326 transitions. [2025-03-17 03:10:28,923 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 326 transitions. Word has length 150 [2025-03-17 03:10:28,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:10:28,924 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 326 transitions. [2025-03-17 03:10:28,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 03:10:28,924 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 326 transitions. [2025-03-17 03:10:28,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 03:10:28,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:28,926 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:10:28,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:10:28,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:28,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:28,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1725647632, now seen corresponding path program 1 times [2025-03-17 03:10:28,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:10:28,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899465634] [2025-03-17 03:10:28,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:28,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:10:28,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 03:10:29,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 03:10:29,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:29,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:10:29,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [166694] [2025-03-17 03:10:29,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:29,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:10:29,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:10:29,065 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-17 03:10:29,067 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-17 03:10:29,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 03:10:29,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 03:10:29,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:29,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:10:29,246 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:10:29,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 03:10:29,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 03:10:29,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:29,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:10:29,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:10:29,375 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:10:29,376 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:10:29,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 03:10:29,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:10:29,581 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 03:10:29,686 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:10:29,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:10:29 BoogieIcfgContainer [2025-03-17 03:10:29,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:10:29,690 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:10:29,690 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:10:29,691 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:10:29,691 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:10:25" (3/4) ... [2025-03-17 03:10:29,694 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:10:29,696 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:10:29,697 INFO L158 Benchmark]: Toolchain (without parser) took 4693.49ms. Allocated memory is still 201.3MB. Free memory was 155.2MB in the beginning and 70.2MB in the end (delta: 85.0MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2025-03-17 03:10:29,697 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:10:29,697 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.65ms. Allocated memory is still 201.3MB. Free memory was 155.2MB in the beginning and 138.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:10:29,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.35ms. Allocated memory is still 201.3MB. Free memory was 138.6MB in the beginning and 133.2MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:10:29,697 INFO L158 Benchmark]: Boogie Preprocessor took 65.01ms. Allocated memory is still 201.3MB. Free memory was 133.2MB in the beginning and 122.5MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:10:29,698 INFO L158 Benchmark]: IcfgBuilder took 414.50ms. Allocated memory is still 201.3MB. Free memory was 122.5MB in the beginning and 92.9MB in the end (delta: 29.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 03:10:29,698 INFO L158 Benchmark]: TraceAbstraction took 3877.19ms. Allocated memory is still 201.3MB. Free memory was 92.5MB in the beginning and 70.3MB in the end (delta: 22.2MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2025-03-17 03:10:29,698 INFO L158 Benchmark]: Witness Printer took 6.00ms. Allocated memory is still 201.3MB. Free memory was 70.3MB in the beginning and 70.2MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:10:29,699 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.65ms. Allocated memory is still 201.3MB. Free memory was 155.2MB in the beginning and 138.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.35ms. Allocated memory is still 201.3MB. Free memory was 138.6MB in the beginning and 133.2MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.01ms. Allocated memory is still 201.3MB. Free memory was 133.2MB in the beginning and 122.5MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 414.50ms. Allocated memory is still 201.3MB. Free memory was 122.5MB in the beginning and 92.9MB in the end (delta: 29.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3877.19ms. Allocated memory is still 201.3MB. Free memory was 92.5MB in the beginning and 70.3MB in the end (delta: 22.2MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * Witness Printer took 6.00ms. Allocated memory is still 201.3MB. Free memory was 70.3MB in the beginning and 70.2MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 127, overapproximation of someBinaryFLOATComparisonOperation at line 167, overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 183, overapproximation of someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 148, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someBinaryArithmeticFLOAToperation at line 86, overapproximation of someBinaryArithmeticFLOAToperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99999999999.75; [L23] float var_1_4 = 31.25; [L24] float var_1_5 = 0.0; [L25] float var_1_6 = 99.5; [L26] float var_1_7 = 500.5; [L27] double var_1_8 = 199.96; [L28] double var_1_9 = 256.95; [L29] signed long int var_1_11 = 1523382513; [L30] double var_1_14 = 32.6; [L31] double var_1_15 = 0.875; [L32] unsigned short int var_1_16 = 1; [L33] unsigned char var_1_17 = 1; [L34] float var_1_18 = 0.3; [L35] signed short int var_1_19 = 4; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_24 = 0; [L38] unsigned char var_1_25 = 16; [L39] unsigned char var_1_26 = 5; [L40] signed short int var_1_27 = 64; [L41] unsigned char var_1_28 = 1; [L42] float var_1_29 = 64.5; [L43] float var_1_30 = 0.0; [L44] unsigned long int var_1_31 = 2; [L45] unsigned long int var_1_32 = 1140371764; [L46] unsigned long int var_1_33 = 3119542188; [L47] double var_1_34 = 10.5; [L48] unsigned short int last_1_var_1_16 = 1; [L49] signed short int last_1_var_1_19 = 4; [L50] signed short int last_1_var_1_27 = 64; [L51] float last_1_var_1_29 = 64.5; [L52] unsigned long int last_1_var_1_31 = 2; [L187] isInitial = 1 [L188] FCALL initially() [L189] int k_loop; [L190] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_4=125/4, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L190] COND TRUE k_loop < 1 [L191] CALL updateLastVariables() [L176] last_1_var_1_16 = var_1_16 [L177] last_1_var_1_19 = var_1_19 [L178] last_1_var_1_27 = var_1_27 [L179] last_1_var_1_29 = var_1_29 [L180] last_1_var_1_31 = var_1_31 [L191] RET updateLastVariables() [L192] CALL updateVariables() [L136] var_1_4 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L137] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L138] var_1_5 = __VERIFIER_nondet_float() [L139] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L139] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L140] var_1_6 = __VERIFIER_nondet_float() [L141] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L141] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L142] var_1_7 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L143] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L144] var_1_11 = __VERIFIER_nondet_long() [L145] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L145] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L146] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L146] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L147] var_1_14 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L148] RET assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L149] var_1_15 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_15 >= -230584.3009213691390e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L150] RET assume_abort_if_not((var_1_15 >= -230584.3009213691390e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L151] var_1_17 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L152] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L153] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L153] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L154] var_1_20 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L155] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L156] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L156] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L157] var_1_25 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L158] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L159] CALL assume_abort_if_not(var_1_25 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L159] RET assume_abort_if_not(var_1_25 <= 64) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L160] var_1_26 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L161] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L162] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L162] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L163] var_1_28 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L164] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L165] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L165] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L166] var_1_30 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_30 >= 2305843.009213691390e+12F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L167] RET assume_abort_if_not((var_1_30 >= 2305843.009213691390e+12F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L168] var_1_32 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_32 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L169] RET assume_abort_if_not(var_1_32 >= 1073741824) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L170] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L170] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L171] var_1_33 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_33 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L172] RET assume_abort_if_not(var_1_33 >= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L173] CALL assume_abort_if_not(var_1_33 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L173] RET assume_abort_if_not(var_1_33 <= 4294967294) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L192] RET updateVariables() [L193] CALL step() [L56] unsigned long int stepLocal_1 = last_1_var_1_31; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L57] COND FALSE !(var_1_4 < (last_1_var_1_29 + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) [L64] var_1_8 = var_1_7 VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L66] COND FALSE !(! var_1_20) [L73] var_1_24 = var_1_26 VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=1, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L75] signed long int stepLocal_6 = (((var_1_24) < (var_1_24)) ? (var_1_24) : (var_1_24)); [L76] unsigned char stepLocal_5 = var_1_28; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_5=1, stepLocal_6=1, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=1, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L77] COND FALSE !(stepLocal_6 < var_1_25) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_5=1, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=1, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L82] signed long int stepLocal_0 = ~ var_1_24; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_0=-2, stepLocal_1=2, stepLocal_5=1, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=1, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L83] COND TRUE stepLocal_0 <= var_1_24 [L84] var_1_1 = (var_1_4 - (var_1_5 - ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))))) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_5=1, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=1, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L86] var_1_29 = (var_1_6 + ((var_1_30 - 7.6f) - var_1_7)) [L87] var_1_31 = ((((((var_1_11 + var_1_32)) > (var_1_33)) ? ((var_1_11 + var_1_32)) : (var_1_33))) - var_1_26) [L88] unsigned char stepLocal_3 = var_1_24; [L89] unsigned long int stepLocal_2 = var_1_31; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-3, stepLocal_3=1, stepLocal_5=1, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=1, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_31=-3, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L90] COND FALSE !(\read(var_1_17)) [L97] var_1_16 = var_1_27 VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-3, stepLocal_3=1, stepLocal_5=1, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=1, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_31=-3, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L99] signed long int stepLocal_8 = ~ var_1_16; [L100] signed long int stepLocal_7 = var_1_24 / var_1_11; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-3, stepLocal_3=1, stepLocal_5=1, stepLocal_7=0, stepLocal_8=-65, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=1, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_31=-3, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L101] COND FALSE !(stepLocal_8 > var_1_31) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-3, stepLocal_3=1, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=1, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_31=-3, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L108] unsigned char stepLocal_4 = var_1_17; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-3, stepLocal_3=1, stepLocal_4=0, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=1, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_31=-3, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L109] COND FALSE !(stepLocal_4 && var_1_20) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-3, stepLocal_3=1, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=1, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_31=-3, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L116] COND FALSE !((var_1_1 * (- var_1_5)) < (var_1_6 - var_1_7)) [L123] var_1_19 = ((var_1_16 + var_1_24) + 16) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-3, stepLocal_3=1, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=81, var_1_20=1, var_1_24=1, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_31=-3, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L126] COND TRUE (var_1_19 - var_1_16) < ((var_1_11 - var_1_24) - var_1_24) [L127] var_1_9 = (var_1_7 + ((((var_1_6) > ((var_1_14 + var_1_15))) ? (var_1_6) : ((var_1_14 + var_1_15))))) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-3, stepLocal_3=1, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=81, var_1_20=1, var_1_24=1, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_31=-3, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2] [L131] COND FALSE !(var_1_19 <= var_1_16) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-3, stepLocal_3=1, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=81, var_1_20=1, var_1_24=1, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_31=-3, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2] [L193] RET step() [L194] CALL, EXPR property() [L183-L184] return ((((((((((((~ var_1_24) <= var_1_24) ? (var_1_1 == ((float) (var_1_4 - (var_1_5 - ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))))))) : 1) && ((var_1_4 < (last_1_var_1_29 + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) ? ((last_1_var_1_19 < last_1_var_1_31) ? (var_1_8 == ((double) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) + var_1_7))) : (var_1_8 == ((double) var_1_4))) : (var_1_8 == ((double) var_1_7)))) && (((var_1_19 - var_1_16) < ((var_1_11 - var_1_24) - var_1_24)) ? (var_1_9 == ((double) (var_1_7 + ((((var_1_6) > ((var_1_14 + var_1_15))) ? (var_1_6) : ((var_1_14 + var_1_15))))))) : (var_1_9 == ((double) (var_1_7 - var_1_5))))) && (var_1_17 ? ((var_1_11 <= var_1_24) ? ((var_1_24 <= var_1_31) ? (var_1_16 == ((unsigned short int) var_1_27)) : 1) : 1) : (var_1_16 == ((unsigned short int) var_1_27)))) && ((var_1_19 <= var_1_16) ? (var_1_18 == ((float) (var_1_15 + 64.4f))) : 1)) && ((var_1_17 && var_1_20) ? (var_1_17 ? (var_1_19 == ((signed short int) ((var_1_16 - var_1_24) + 50))) : (var_1_19 == ((signed short int) ((((var_1_24) > (var_1_16)) ? (var_1_24) : (var_1_16)))))) : (((var_1_1 * (- var_1_5)) < (var_1_6 - var_1_7)) ? ((var_1_14 == var_1_8) ? (var_1_19 == ((signed short int) var_1_16)) : (var_1_19 == ((signed short int) (var_1_16 + var_1_24)))) : (var_1_19 == ((signed short int) ((var_1_16 + var_1_24) + 16)))))) && ((! var_1_20) ? ((last_1_var_1_16 <= last_1_var_1_16) ? (var_1_24 == ((unsigned char) ((var_1_25 + 1) + var_1_26))) : (var_1_24 == ((unsigned char) var_1_26))) : (var_1_24 == ((unsigned char) var_1_26)))) && ((((((var_1_24) < (var_1_24)) ? (var_1_24) : (var_1_24))) < var_1_25) ? (((var_1_20 || var_1_17) && var_1_28) ? (var_1_27 == ((signed short int) (((((((((var_1_24) > (var_1_24)) ? (var_1_24) : (var_1_24))) + last_1_var_1_27)) < (((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26))))) ? ((((((var_1_24) > (var_1_24)) ? (var_1_24) : (var_1_24))) + last_1_var_1_27)) : (((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))))) : 1) : 1)) && (var_1_29 == ((float) (var_1_6 + ((var_1_30 - 7.6f) - var_1_7))))) && (var_1_31 == ((unsigned long int) ((((((var_1_11 + var_1_32)) > (var_1_33)) ? ((var_1_11 + var_1_32)) : (var_1_33))) - var_1_26)))) && (((~ var_1_16) > var_1_31) ? (((var_1_24 / var_1_11) >= var_1_26) ? (var_1_34 == ((double) ((((((-5.2001036938992108E18) < 0 ) ? -(-5.2001036938992108E18) : (-5.2001036938992108E18))) - 50.25) - var_1_4))) : (var_1_34 == ((double) var_1_7))) : 1) ; [L194] RET, EXPR property() [L194] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=81, var_1_20=1, var_1_24=1, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_31=-3, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=81, var_1_20=1, var_1_24=1, var_1_25=-255, var_1_26=1, var_1_27=64, var_1_28=1, var_1_31=-3, var_1_32=-2147483649, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 139 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 349 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 1244 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 691 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 312 IncrementalHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 553 mSDtfsCounter, 312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=4, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 162 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1050 NumberOfCodeBlocks, 1050 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 745 ConstructedInterpolants, 0 QuantifiedInterpolants, 1072 SizeOfPredicates, 0 NumberOfNonLiveVariables, 373 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 5016/5060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 03:10:29,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.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 046e4169d322167d7576c9c2b9007e1beb6aeeec9394209bc254f3d13fdc20dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:10:31,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:10:31,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:10:31,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:10:31,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:10:31,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:10:31,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:10:31,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:10:31,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:10:31,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:10:31,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:10:31,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:10:31,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:10:31,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:10:31,797 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:10:31,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:10:31,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:10:31,798 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:10:31,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:10:31,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:10:31,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:10:31,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:10:31,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:10:31,798 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:10:31,799 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:10:31,799 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:10:31,799 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:10:31,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:10:31,799 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:10:31,799 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:10:31,799 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:10:31,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:10:31,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:10:31,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:10:31,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:10:31,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:10:31,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:10:31,800 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:10:31,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:10:31,800 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:10:31,800 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:10:31,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:10:31,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:10:31,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:10:31,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:10:31,801 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 -> 046e4169d322167d7576c9c2b9007e1beb6aeeec9394209bc254f3d13fdc20dd [2025-03-17 03:10:32,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:10:32,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:10:32,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:10:32,046 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:10:32,046 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:10:32,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i [2025-03-17 03:10:33,276 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f309f87b5/5349a49de2844888b5c32cdb4f857608/FLAG2a5e63760 [2025-03-17 03:10:33,483 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:10:33,484 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i [2025-03-17 03:10:33,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f309f87b5/5349a49de2844888b5c32cdb4f857608/FLAG2a5e63760 [2025-03-17 03:10:33,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f309f87b5/5349a49de2844888b5c32cdb4f857608 [2025-03-17 03:10:33,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:10:33,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:10:33,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:10:33,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:10:33,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:10:33,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:10:33" (1/1) ... [2025-03-17 03:10:33,523 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2031bc04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:33, skipping insertion in model container [2025-03-17 03:10:33,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:10:33" (1/1) ... [2025-03-17 03:10:33,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:10:33,658 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_100-1loop_file-84.i[916,929] [2025-03-17 03:10:33,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:10:33,747 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:10:33,755 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_100-1loop_file-84.i[916,929] [2025-03-17 03:10:33,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:10:33,803 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:10:33,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:33 WrapperNode [2025-03-17 03:10:33,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:10:33,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:10:33,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:10:33,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:10:33,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:33" (1/1) ... [2025-03-17 03:10:33,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:33" (1/1) ... [2025-03-17 03:10:33,861 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-03-17 03:10:33,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:10:33,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:10:33,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:10:33,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:10:33,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:33" (1/1) ... [2025-03-17 03:10:33,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:33" (1/1) ... [2025-03-17 03:10:33,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:33" (1/1) ... [2025-03-17 03:10:33,896 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:10:33,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:33" (1/1) ... [2025-03-17 03:10:33,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:33" (1/1) ... [2025-03-17 03:10:33,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:33" (1/1) ... [2025-03-17 03:10:33,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:33" (1/1) ... [2025-03-17 03:10:33,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:33" (1/1) ... [2025-03-17 03:10:33,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:33" (1/1) ... [2025-03-17 03:10:33,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:10:33,915 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:10:33,915 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:10:33,915 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:10:33,916 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:33" (1/1) ... [2025-03-17 03:10:33,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:10:33,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:10:33,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:10:33,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:10:33,973 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:10:33,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:10:34,037 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:10:34,038 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:10:47,029 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-17 03:10:47,032 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:10:47,040 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:10:47,041 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:10:47,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:10:47 BoogieIcfgContainer [2025-03-17 03:10:47,041 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:10:47,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:10:47,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:10:47,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:10:47,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:10:33" (1/3) ... [2025-03-17 03:10:47,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451b2f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:10:47, skipping insertion in model container [2025-03-17 03:10:47,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:33" (2/3) ... [2025-03-17 03:10:47,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451b2f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:10:47, skipping insertion in model container [2025-03-17 03:10:47,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:10:47" (3/3) ... [2025-03-17 03:10:47,050 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-84.i [2025-03-17 03:10:47,065 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:10:47,066 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-84.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:10:47,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:10:47,116 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;@7995305a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:10:47,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:10:47,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 49 states have internal predecessors, (70), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 03:10:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 03:10:47,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:47,131 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:10:47,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:47,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:47,136 INFO L85 PathProgramCache]: Analyzing trace with hash 150458967, now seen corresponding path program 1 times [2025-03-17 03:10:47,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:10:47,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492634257] [2025-03-17 03:10:47,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:47,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:10:47,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:10:47,152 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:10:47,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 03:10:47,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 03:10:47,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 03:10:47,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:47,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:47,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:10:47,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:10:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-03-17 03:10:47,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:10:47,949 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:10:47,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492634257] [2025-03-17 03:10:47,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492634257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:10:47,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:10:47,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:10:47,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619347543] [2025-03-17 03:10:47,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:10:47,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:10:47,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:10:47,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:10:47,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:10:47,973 INFO L87 Difference]: Start difference. First operand has 74 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 49 states have internal predecessors, (70), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 03:10:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:10:48,000 INFO L93 Difference]: Finished difference Result 147 states and 254 transitions. [2025-03-17 03:10:48,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:10:48,002 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2025-03-17 03:10:48,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:10:48,007 INFO L225 Difference]: With dead ends: 147 [2025-03-17 03:10:48,008 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 03:10:48,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:10:48,012 INFO L435 NwaCegarLoop]: 113 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, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:10:48,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:10:48,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 03:10:48,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-17 03:10:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 03:10:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 111 transitions. [2025-03-17 03:10:48,042 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 111 transitions. Word has length 150 [2025-03-17 03:10:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:10:48,042 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 111 transitions. [2025-03-17 03:10:48,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 03:10:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 111 transitions. [2025-03-17 03:10:48,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 03:10:48,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:48,046 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:10:48,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 03:10:48,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:10:48,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:48,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:48,247 INFO L85 PathProgramCache]: Analyzing trace with hash 723597556, now seen corresponding path program 1 times [2025-03-17 03:10:48,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:10:48,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203984229] [2025-03-17 03:10:48,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:48,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:10:48,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:10:48,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:10:48,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 03:10:48,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 03:10:48,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 03:10:48,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:48,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:48,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 03:10:48,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:10:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 39 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-17 03:10:50,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:10:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 03:10:51,966 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:10:51,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203984229] [2025-03-17 03:10:51,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203984229] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 03:10:51,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:10:51,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2025-03-17 03:10:51,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971186978] [2025-03-17 03:10:51,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:10:51,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:10:51,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:10:51,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:10:51,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:10:51,968 INFO L87 Difference]: Start difference. First operand 72 states and 111 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 03:10:56,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:11:00,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:11:04,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:11:08,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:11:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:11:08,617 INFO L93 Difference]: Finished difference Result 177 states and 269 transitions. [2025-03-17 03:11:08,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:11:08,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2025-03-17 03:11:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:11:08,622 INFO L225 Difference]: With dead ends: 177 [2025-03-17 03:11:08,623 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 03:11:08,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:11:08,624 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 44 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:11:08,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 368 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 4 Unknown, 0 Unchecked, 16.5s Time] [2025-03-17 03:11:08,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 03:11:08,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2025-03-17 03:11:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 70 states have internal predecessors, (94), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 03:11:08,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 156 transitions. [2025-03-17 03:11:08,636 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 156 transitions. Word has length 150 [2025-03-17 03:11:08,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:11:08,636 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 156 transitions. [2025-03-17 03:11:08,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 03:11:08,636 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 156 transitions. [2025-03-17 03:11:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 03:11:08,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:08,638 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:11:08,664 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 (3)] Ended with exit code 0 [2025-03-17 03:11:08,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:11:08,839 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:08,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:08,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1725617841, now seen corresponding path program 1 times [2025-03-17 03:11:08,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:11:08,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290376046] [2025-03-17 03:11:08,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:08,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:11:08,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:11:08,845 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:11:08,848 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 (4)] Waiting until timeout for monitored process [2025-03-17 03:11:08,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 03:11:10,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 03:11:10,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:10,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:10,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 03:11:10,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:11:15,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-03-17 03:11:15,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:11:17,595 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:11:17,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290376046] [2025-03-17 03:11:17,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290376046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:11:17,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1667664996] [2025-03-17 03:11:17,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:17,595 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 03:11:17,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 03:11:17,614 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 03:11:17,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-17 03:11:17,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 03:11:19,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 03:11:19,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:19,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:19,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 03:11:19,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:11:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-03-17 03:11:24,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:11:25,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1667664996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:11:25,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:11:25,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-17 03:11:25,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735741243] [2025-03-17 03:11:25,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:11:25,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:11:25,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:11:25,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:11:25,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:11:25,292 INFO L87 Difference]: Start difference. First operand 103 states and 156 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 03:11:34,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:11:42,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 03:11:46,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 03:11:49,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 03:11:54,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:11:57,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:11:59,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:12:04,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]