./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee1bf5a100c560c161691455551c965071f499d9e9eea4cb62c63597da53f17e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:53:25,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:53:25,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:53:25,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:53:25,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:53:25,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:53:25,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:53:25,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:53:25,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:53:25,887 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:53:25,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:53:25,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:53:25,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:53:25,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:53:25,888 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:53:25,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:53:25,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:53:25,889 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:53:25,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:53:25,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:53:25,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:53:25,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:53:25,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:53:25,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:53:25,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:53:25,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:53:25,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:53:25,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:53:25,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:53:25,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:53:25,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:53:25,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:53:25,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:53:25,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:53:25,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:53:25,891 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:53:25,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:53:25,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:53:25,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:53:25,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:53:25,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:53:25,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:53:25,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:53:25,892 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 -> ee1bf5a100c560c161691455551c965071f499d9e9eea4cb62c63597da53f17e [2025-03-08 13:53:26,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:53:26,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:53:26,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:53:26,161 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:53:26,161 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:53:26,162 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-0.i [2025-03-08 13:53:27,336 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa6061ce/d69d8580744145c0b9905b7f4b01e218/FLAG5ed478d9f [2025-03-08 13:53:27,555 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:53:27,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-0.i [2025-03-08 13:53:27,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa6061ce/d69d8580744145c0b9905b7f4b01e218/FLAG5ed478d9f [2025-03-08 13:53:27,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa6061ce/d69d8580744145c0b9905b7f4b01e218 [2025-03-08 13:53:27,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:53:27,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:53:27,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:53:27,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:53:27,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:53:27,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:53:27" (1/1) ... [2025-03-08 13:53:27,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ac26d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:27, skipping insertion in model container [2025-03-08 13:53:27,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:53:27" (1/1) ... [2025-03-08 13:53:27,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:53:28,053 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-0.i[915,928] [2025-03-08 13:53:28,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:53:28,148 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:53:28,160 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-0.i[915,928] [2025-03-08 13:53:28,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:53:28,219 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:53:28,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:28 WrapperNode [2025-03-08 13:53:28,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:53:28,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:53:28,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:53:28,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:53:28,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:28" (1/1) ... [2025-03-08 13:53:28,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:28" (1/1) ... [2025-03-08 13:53:28,290 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2025-03-08 13:53:28,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:53:28,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:53:28,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:53:28,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:53:28,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:28" (1/1) ... [2025-03-08 13:53:28,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:28" (1/1) ... [2025-03-08 13:53:28,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:28" (1/1) ... [2025-03-08 13:53:28,337 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:53:28,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:28" (1/1) ... [2025-03-08 13:53:28,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:28" (1/1) ... [2025-03-08 13:53:28,358 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:28" (1/1) ... [2025-03-08 13:53:28,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:28" (1/1) ... [2025-03-08 13:53:28,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:28" (1/1) ... [2025-03-08 13:53:28,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:28" (1/1) ... [2025-03-08 13:53:28,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:53:28,379 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:53:28,379 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:53:28,379 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:53:28,380 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:28" (1/1) ... [2025-03-08 13:53:28,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:53:28,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:53:28,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:53:28,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:53:28,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:53:28,428 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:53:28,429 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:53:28,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:53:28,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:53:28,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:53:28,494 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:53:28,495 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:53:28,926 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short22#1;havoc property_#t~ite25#1;havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short26#1; [2025-03-08 13:53:28,960 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-08 13:53:28,960 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:53:28,976 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:53:28,976 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:53:28,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:53:28 BoogieIcfgContainer [2025-03-08 13:53:28,977 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:53:28,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:53:28,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:53:28,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:53:28,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:53:27" (1/3) ... [2025-03-08 13:53:28,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ae66c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:53:28, skipping insertion in model container [2025-03-08 13:53:28,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:28" (2/3) ... [2025-03-08 13:53:28,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ae66c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:53:28, skipping insertion in model container [2025-03-08 13:53:28,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:53:28" (3/3) ... [2025-03-08 13:53:28,986 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-0.i [2025-03-08 13:53:28,997 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:53:28,999 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-0.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:53:29,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:53:29,057 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;@642acfc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:53:29,058 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:53:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 78 states have internal predecessors, (113), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:53:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 13:53:29,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:53:29,073 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:53:29,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:53:29,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:53:29,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1888660124, now seen corresponding path program 1 times [2025-03-08 13:53:29,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:53:29,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999198362] [2025-03-08 13:53:29,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:53:29,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:53:29,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 13:53:29,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 13:53:29,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:53:29,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:53:29,355 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-08 13:53:29,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:53:29,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999198362] [2025-03-08 13:53:29,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999198362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:53:29,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772339042] [2025-03-08 13:53:29,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:53:29,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:53:29,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:53:29,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:53:29,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:53:29,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 13:53:29,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 13:53:29,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:53:29,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:53:29,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:53:29,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:53:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-08 13:53:29,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:53:29,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772339042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:53:29,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:53:29,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:53:29,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459291490] [2025-03-08 13:53:29,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:53:29,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:53:29,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:53:29,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:53:29,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:53:29,575 INFO L87 Difference]: Start difference. First operand has 102 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 78 states have internal predecessors, (113), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 13:53:29,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:53:29,603 INFO L93 Difference]: Finished difference Result 191 states and 316 transitions. [2025-03-08 13:53:29,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:53:29,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 152 [2025-03-08 13:53:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:53:29,611 INFO L225 Difference]: With dead ends: 191 [2025-03-08 13:53:29,611 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 13:53:29,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:53:29,617 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:53:29,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:53:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 13:53:29,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-08 13:53:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:53:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 133 transitions. [2025-03-08 13:53:29,654 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 133 transitions. Word has length 152 [2025-03-08 13:53:29,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:53:29,655 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 133 transitions. [2025-03-08 13:53:29,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 13:53:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 133 transitions. [2025-03-08 13:53:29,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 13:53:29,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:53:29,661 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:53:29,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 13:53:29,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:53:29,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:53:29,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:53:29,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1961605978, now seen corresponding path program 1 times [2025-03-08 13:53:29,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:53:29,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786084739] [2025-03-08 13:53:29,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:53:29,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:53:29,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 13:53:30,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 13:53:30,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:53:30,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:53:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 13:53:30,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:53:30,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786084739] [2025-03-08 13:53:30,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786084739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:53:30,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:53:30,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:53:30,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030088375] [2025-03-08 13:53:30,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:53:30,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:53:30,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:53:30,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:53:30,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:53:30,577 INFO L87 Difference]: Start difference. First operand 89 states and 133 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 13:53:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:53:30,849 INFO L93 Difference]: Finished difference Result 290 states and 438 transitions. [2025-03-08 13:53:30,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:53:30,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-08 13:53:30,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:53:30,851 INFO L225 Difference]: With dead ends: 290 [2025-03-08 13:53:30,851 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 13:53:30,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 13:53:30,853 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 167 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:53:30,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 355 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:53:30,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 13:53:30,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 119. [2025-03-08 13:53:30,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:53:30,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2025-03-08 13:53:30,869 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 177 transitions. Word has length 152 [2025-03-08 13:53:30,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:53:30,869 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 177 transitions. [2025-03-08 13:53:30,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 13:53:30,869 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 177 transitions. [2025-03-08 13:53:30,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 13:53:30,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:53:30,871 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:53:30,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:53:30,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:53:30,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:53:30,872 INFO L85 PathProgramCache]: Analyzing trace with hash 716841497, now seen corresponding path program 1 times [2025-03-08 13:53:30,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:53:30,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493691419] [2025-03-08 13:53:30,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:53:30,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:53:30,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 13:53:31,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 13:53:31,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:53:31,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:53:31,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [30147205] [2025-03-08 13:53:31,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:53:31,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:53:31,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:53:31,014 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:53:31,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 13:53:31,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 13:53:31,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 13:53:31,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:53:31,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:53:31,177 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:53:31,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 13:53:31,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 13:53:31,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:53:31,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:53:31,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:53:31,299 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:53:31,299 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:53:31,309 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-08 13:53:31,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 13:53:31,504 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 13:53:31,586 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:53:31,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:53:31 BoogieIcfgContainer [2025-03-08 13:53:31,588 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:53:31,589 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:53:31,589 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:53:31,590 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:53:31,590 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:53:28" (3/4) ... [2025-03-08 13:53:31,592 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:53:31,592 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:53:31,593 INFO L158 Benchmark]: Toolchain (without parser) took 3677.14ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 83.6MB in the end (delta: 37.6MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2025-03-08 13:53:31,594 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 192.9MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:53:31,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.58ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 104.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:53:31,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.85ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 95.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:53:31,595 INFO L158 Benchmark]: Boogie Preprocessor took 86.97ms. Allocated memory is still 167.8MB. Free memory was 95.9MB in the beginning and 85.2MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:53:31,596 INFO L158 Benchmark]: IcfgBuilder took 597.57ms. Allocated memory is still 167.8MB. Free memory was 84.8MB in the beginning and 40.8MB in the end (delta: 44.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-08 13:53:31,596 INFO L158 Benchmark]: TraceAbstraction took 2609.84ms. Allocated memory is still 167.8MB. Free memory was 40.1MB in the beginning and 83.6MB in the end (delta: -43.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:53:31,596 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 167.8MB. Free memory was 83.6MB in the beginning and 83.6MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:53:31,597 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 192.9MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.58ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 104.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.85ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 95.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.97ms. Allocated memory is still 167.8MB. Free memory was 95.9MB in the beginning and 85.2MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 597.57ms. Allocated memory is still 167.8MB. Free memory was 84.8MB in the beginning and 40.8MB in the end (delta: 44.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2609.84ms. Allocated memory is still 167.8MB. Free memory was 40.1MB in the beginning and 83.6MB in the end (delta: -43.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 167.8MB. Free memory was 83.6MB in the beginning and 83.6MB in the end (delta: 30.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 83, overapproximation of someBinaryFLOATComparisonOperation at line 140, overapproximation of someBinaryFLOATComparisonOperation at line 142, overapproximation of someUnaryDOUBLEoperation at line 34, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryArithmeticFLOAToperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] double var_1_2 = 99999999999.3; [L24] double var_1_3 = 1.7; [L25] signed long int var_1_6 = 2; [L26] signed long int var_1_8 = 1427256974; [L27] signed short int var_1_11 = 0; [L28] signed long int var_1_14 = 256; [L29] unsigned short int var_1_15 = 2; [L30] signed short int var_1_19 = 32; [L31] double var_1_23 = 4.7; [L32] double var_1_24 = 0.0; [L33] double var_1_25 = 128.25; [L34] float var_1_26 = -0.2; [L35] float var_1_27 = 31.25; [L36] float var_1_28 = 24.4; [L37] unsigned char var_1_29 = 1; [L38] unsigned char var_1_30 = 236; [L39] unsigned char var_1_31 = 5; [L40] unsigned char var_1_32 = 1; [L41] unsigned char var_1_33 = 64; [L42] unsigned char var_1_34 = 100; [L43] unsigned char var_1_35 = 5; [L44] double var_1_36 = 7.5; [L45] signed short int var_1_37 = 16; [L46] unsigned char var_1_38 = 64; [L47] signed char var_1_39 = -1; [L48] unsigned char var_1_40 = 0; [L49] unsigned char var_1_41 = 0; [L50] unsigned short int last_1_var_1_15 = 2; VAL [isInitial=0, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_2=999999999993/10, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_3=17/10, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L173] isInitial = 1 [L174] FCALL initially() [L175] int k_loop; [L176] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_2=999999999993/10, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_3=17/10, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L176] COND TRUE k_loop < 1 [L177] CALL updateLastVariables() [L166] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_2=999999999993/10, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_3=17/10, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L177] RET updateLastVariables() [L178] CALL updateVariables() [L128] var_1_2 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_3=17/10, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_3=17/10, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L129] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_3=17/10, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L130] var_1_3 = __VERIFIER_nondet_double() [L131] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L131] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L132] var_1_8 = __VERIFIER_nondet_long() [L133] CALL assume_abort_if_not(var_1_8 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L133] RET assume_abort_if_not(var_1_8 >= 1073741823) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L134] CALL assume_abort_if_not(var_1_8 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L134] RET assume_abort_if_not(var_1_8 <= 2147483646) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L135] var_1_24 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_24 >= 4611686.018427382800e+12F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L136] RET assume_abort_if_not((var_1_24 >= 4611686.018427382800e+12F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L137] var_1_25 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_25 >= 0.0F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L138] RET assume_abort_if_not((var_1_25 >= 0.0F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L139] var_1_27 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 2305843.009213691390e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L140] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 2305843.009213691390e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L141] var_1_28 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L142] RET assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L143] var_1_30 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_30 >= 222) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L144] RET assume_abort_if_not(var_1_30 >= 222) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L145] CALL assume_abort_if_not(var_1_30 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L145] RET assume_abort_if_not(var_1_30 <= 254) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L146] var_1_31 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L147] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L148] CALL assume_abort_if_not(var_1_31 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L148] RET assume_abort_if_not(var_1_31 <= 32) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L149] var_1_32 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L150] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L151] CALL assume_abort_if_not(var_1_32 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L151] RET assume_abort_if_not(var_1_32 <= 63) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L152] var_1_33 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_33 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L153] RET assume_abort_if_not(var_1_33 >= 63) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L154] CALL assume_abort_if_not(var_1_33 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L154] RET assume_abort_if_not(var_1_33 <= 127) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L155] var_1_34 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_34 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L156] RET assume_abort_if_not(var_1_34 >= 63) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L157] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L157] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L158] var_1_35 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L159] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L160] CALL assume_abort_if_not(var_1_35 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L160] RET assume_abort_if_not(var_1_35 <= 63) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L161] var_1_41 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_41 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L162] RET assume_abort_if_not(var_1_41 >= 1) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L163] CALL assume_abort_if_not(var_1_41 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L163] RET assume_abort_if_not(var_1_41 <= 1) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L178] RET updateVariables() [L179] CALL step() [L54] var_1_38 = var_1_31 [L55] var_1_39 = var_1_31 [L56] var_1_40 = var_1_41 [L57] unsigned char stepLocal_4 = var_1_40; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_4=1, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L58] COND TRUE stepLocal_4 && var_1_40 [L59] var_1_29 = (((var_1_30 - var_1_31) - var_1_32) - (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))))) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L61] COND TRUE \read(var_1_40) [L62] var_1_36 = (var_1_28 + var_1_27) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L66] signed long int stepLocal_1 = ~ var_1_29; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_1=-128, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L67] COND TRUE stepLocal_1 < var_1_8 [L68] var_1_14 = ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=127, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L70] unsigned char stepLocal_2 = var_1_29; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_2=127, var_1_11=0, var_1_14=127, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L71] COND FALSE !((last_1_var_1_15 + var_1_39) > stepLocal_2) [L76] var_1_15 = (var_1_38 + var_1_38) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=127, var_1_15=0, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L78] unsigned char stepLocal_3 = var_1_40; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_3=1, var_1_11=0, var_1_14=127, var_1_15=0, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L79] COND TRUE var_1_40 && stepLocal_3 [L80] var_1_19 = (var_1_29 + var_1_29) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=127, var_1_15=0, var_1_19=254, var_1_1=64, var_1_23=47/10, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L82] COND TRUE ((((var_1_19) < (var_1_38)) ? (var_1_19) : (var_1_38))) > (var_1_38 - ((((var_1_15) > (5)) ? (var_1_15) : (5)))) [L83] var_1_23 = (10.65 - (var_1_24 - var_1_25)) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=127, var_1_15=0, var_1_19=254, var_1_1=64, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L85] COND FALSE !(var_1_38 > var_1_38) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=127, var_1_15=0, var_1_19=254, var_1_1=64, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L90] COND FALSE !((var_1_2 - var_1_3) == (- var_1_26)) [L97] var_1_1 = var_1_29 VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=127, var_1_15=0, var_1_19=254, var_1_1=127, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L99] var_1_6 = (var_1_15 - (((((var_1_8 - var_1_15)) < (var_1_38)) ? ((var_1_8 - var_1_15)) : (var_1_38)))) [L100] signed long int stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_0=1073741823, var_1_11=0, var_1_14=127, var_1_15=0, var_1_19=254, var_1_1=127, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=0, var_1_8=1073741823] [L101] COND TRUE \read(var_1_40) [L102] var_1_11 = var_1_39 VAL [isInitial=1, last_1_var_1_15=2, stepLocal_0=1073741823, var_1_11=0, var_1_14=127, var_1_15=0, var_1_19=254, var_1_1=127, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=0, var_1_8=1073741823] [L108] unsigned char stepLocal_7 = var_1_40; [L109] signed char stepLocal_6 = var_1_39; [L110] unsigned char stepLocal_5 = var_1_29; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_0=1073741823, stepLocal_5=127, stepLocal_6=0, stepLocal_7=1, var_1_11=0, var_1_14=127, var_1_15=0, var_1_19=254, var_1_1=127, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=0, var_1_8=1073741823] [L111] COND FALSE !(((var_1_35 / var_1_34) % var_1_30) >= stepLocal_5) [L124] var_1_37 = var_1_32 VAL [isInitial=1, last_1_var_1_15=2, stepLocal_0=1073741823, stepLocal_6=0, stepLocal_7=1, var_1_11=0, var_1_14=127, var_1_15=0, var_1_19=254, var_1_1=127, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=63, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=0, var_1_8=1073741823] [L179] RET step() [L180] CALL, EXPR property() [L169] EXPR (((((((((var_1_2 - var_1_3) == (- var_1_26)) ? ((var_1_3 <= ((var_1_26 * 1.5) + 127.4)) ? (var_1_1 == ((signed short int) var_1_29)) : (var_1_1 == ((signed short int) var_1_29))) : (var_1_1 == ((signed short int) var_1_29))) && (var_1_6 == ((signed long int) (var_1_15 - (((((var_1_8 - var_1_15)) < (var_1_38)) ? ((var_1_8 - var_1_15)) : (var_1_38))))))) && (var_1_40 ? (var_1_11 == ((signed short int) var_1_39)) : ((var_1_8 <= ((((var_1_1) > (var_1_39)) ? (var_1_1) : (var_1_39)))) ? (var_1_11 == ((signed short int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1))) && (((~ var_1_29) < var_1_8) ? (var_1_14 == ((signed long int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1)) && (((last_1_var_1_15 + var_1_39) > var_1_29) ? (var_1_40 ? (var_1_15 == ((unsigned short int) (((((var_1_38) < (var_1_38)) ? (var_1_38) : (var_1_38))) + var_1_29))) : 1) : (var_1_15 == ((unsigned short int) (var_1_38 + var_1_38))))) && ((var_1_40 && var_1_40) ? (var_1_19 == ((signed short int) (var_1_29 + var_1_29))) : 1)) && ((((((var_1_19) < (var_1_38)) ? (var_1_19) : (var_1_38))) > (var_1_38 - ((((var_1_15) > (5)) ? (var_1_15) : (5))))) ? (var_1_23 == ((double) (10.65 - (var_1_24 - var_1_25)))) : 1)) && ((var_1_38 > var_1_38) ? (((var_1_38 ^ var_1_29) < var_1_8) ? (var_1_26 == ((float) (((128.05f - var_1_27) + ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))) + var_1_25))) : 1) : 1) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=127, var_1_15=0, var_1_19=254, var_1_1=127, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=63, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=0, var_1_8=1073741823] [L169] EXPR ((((((((((((var_1_2 - var_1_3) == (- var_1_26)) ? ((var_1_3 <= ((var_1_26 * 1.5) + 127.4)) ? (var_1_1 == ((signed short int) var_1_29)) : (var_1_1 == ((signed short int) var_1_29))) : (var_1_1 == ((signed short int) var_1_29))) && (var_1_6 == ((signed long int) (var_1_15 - (((((var_1_8 - var_1_15)) < (var_1_38)) ? ((var_1_8 - var_1_15)) : (var_1_38))))))) && (var_1_40 ? (var_1_11 == ((signed short int) var_1_39)) : ((var_1_8 <= ((((var_1_1) > (var_1_39)) ? (var_1_1) : (var_1_39)))) ? (var_1_11 == ((signed short int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1))) && (((~ var_1_29) < var_1_8) ? (var_1_14 == ((signed long int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1)) && (((last_1_var_1_15 + var_1_39) > var_1_29) ? (var_1_40 ? (var_1_15 == ((unsigned short int) (((((var_1_38) < (var_1_38)) ? (var_1_38) : (var_1_38))) + var_1_29))) : 1) : (var_1_15 == ((unsigned short int) (var_1_38 + var_1_38))))) && ((var_1_40 && var_1_40) ? (var_1_19 == ((signed short int) (var_1_29 + var_1_29))) : 1)) && ((((((var_1_19) < (var_1_38)) ? (var_1_19) : (var_1_38))) > (var_1_38 - ((((var_1_15) > (5)) ? (var_1_15) : (5))))) ? (var_1_23 == ((double) (10.65 - (var_1_24 - var_1_25)))) : 1)) && ((var_1_38 > var_1_38) ? (((var_1_38 ^ var_1_29) < var_1_8) ? (var_1_26 == ((float) (((128.05f - var_1_27) + ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))) + var_1_25))) : 1) : 1)) && ((var_1_40 && var_1_40) ? (var_1_29 == ((unsigned char) (((var_1_30 - var_1_31) - var_1_32) - (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))))))) : 1)) && (var_1_40 ? (var_1_36 == ((double) (var_1_28 + var_1_27))) : (var_1_36 == ((double) ((var_1_27 + var_1_28) + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25)))))))) && ((((var_1_35 / var_1_34) % var_1_30) >= var_1_29) ? ((var_1_40 || var_1_40) ? (((var_1_39 * (var_1_38 & 64)) < var_1_39) ? (((var_1_27 - var_1_24) <= var_1_3) ? (var_1_37 == ((signed short int) (var_1_33 - var_1_11))) : (var_1_37 == ((signed short int) ((((var_1_32) < ((((((var_1_33) < (var_1_35)) ? (var_1_33) : (var_1_35))) + var_1_39))) ? (var_1_32) : ((((((var_1_33) < (var_1_35)) ? (var_1_33) : (var_1_35))) + var_1_39))))))) : (var_1_37 == ((signed short int) ((((((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34)))) < (var_1_11)) ? (((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34)))) : (var_1_11)))))) : 1) : (var_1_37 == ((signed short int) var_1_32))) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=127, var_1_15=0, var_1_19=254, var_1_1=127, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=63, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=0, var_1_8=1073741823] [L169-L170] return (((((((((((((((var_1_2 - var_1_3) == (- var_1_26)) ? ((var_1_3 <= ((var_1_26 * 1.5) + 127.4)) ? (var_1_1 == ((signed short int) var_1_29)) : (var_1_1 == ((signed short int) var_1_29))) : (var_1_1 == ((signed short int) var_1_29))) && (var_1_6 == ((signed long int) (var_1_15 - (((((var_1_8 - var_1_15)) < (var_1_38)) ? ((var_1_8 - var_1_15)) : (var_1_38))))))) && (var_1_40 ? (var_1_11 == ((signed short int) var_1_39)) : ((var_1_8 <= ((((var_1_1) > (var_1_39)) ? (var_1_1) : (var_1_39)))) ? (var_1_11 == ((signed short int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1))) && (((~ var_1_29) < var_1_8) ? (var_1_14 == ((signed long int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1)) && (((last_1_var_1_15 + var_1_39) > var_1_29) ? (var_1_40 ? (var_1_15 == ((unsigned short int) (((((var_1_38) < (var_1_38)) ? (var_1_38) : (var_1_38))) + var_1_29))) : 1) : (var_1_15 == ((unsigned short int) (var_1_38 + var_1_38))))) && ((var_1_40 && var_1_40) ? (var_1_19 == ((signed short int) (var_1_29 + var_1_29))) : 1)) && ((((((var_1_19) < (var_1_38)) ? (var_1_19) : (var_1_38))) > (var_1_38 - ((((var_1_15) > (5)) ? (var_1_15) : (5))))) ? (var_1_23 == ((double) (10.65 - (var_1_24 - var_1_25)))) : 1)) && ((var_1_38 > var_1_38) ? (((var_1_38 ^ var_1_29) < var_1_8) ? (var_1_26 == ((float) (((128.05f - var_1_27) + ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))) + var_1_25))) : 1) : 1)) && ((var_1_40 && var_1_40) ? (var_1_29 == ((unsigned char) (((var_1_30 - var_1_31) - var_1_32) - (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))))))) : 1)) && (var_1_40 ? (var_1_36 == ((double) (var_1_28 + var_1_27))) : (var_1_36 == ((double) ((var_1_27 + var_1_28) + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25)))))))) && ((((var_1_35 / var_1_34) % var_1_30) >= var_1_29) ? ((var_1_40 || var_1_40) ? (((var_1_39 * (var_1_38 & 64)) < var_1_39) ? (((var_1_27 - var_1_24) <= var_1_3) ? (var_1_37 == ((signed short int) (var_1_33 - var_1_11))) : (var_1_37 == ((signed short int) ((((var_1_32) < ((((((var_1_33) < (var_1_35)) ? (var_1_33) : (var_1_35))) + var_1_39))) ? (var_1_32) : ((((((var_1_33) < (var_1_35)) ? (var_1_33) : (var_1_35))) + var_1_39))))))) : (var_1_37 == ((signed short int) ((((((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34)))) < (var_1_11)) ? (((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34)))) : (var_1_11)))))) : 1) : (var_1_37 == ((signed short int) var_1_32)))) && (var_1_38 == ((unsigned char) var_1_31))) && (var_1_39 == ((signed char) var_1_31))) && (var_1_40 == ((unsigned char) var_1_41)) ; [L180] RET, EXPR property() [L180] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=127, var_1_15=0, var_1_19=254, var_1_1=127, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=63, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=0, var_1_8=1073741823] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=127, var_1_15=0, var_1_19=254, var_1_1=127, var_1_29=127, var_1_30=254, var_1_31=-256, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=63, var_1_37=63, var_1_38=-256, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=0, var_1_8=1073741823] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 179 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 489 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 227 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129 IncrementalHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 262 mSDtfsCounter, 129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 85 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 760 NumberOfCodeBlocks, 760 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 485 SizeOfPredicates, 0 NumberOfNonLiveVariables, 363 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2730/2772 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 13:53:31,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee1bf5a100c560c161691455551c965071f499d9e9eea4cb62c63597da53f17e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:53:33,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:53:33,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:53:33,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:53:33,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:53:33,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:53:33,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:53:33,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:53:33,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:53:33,580 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:53:33,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:53:33,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:53:33,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:53:33,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:53:33,581 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:53:33,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:53:33,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:53:33,582 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:53:33,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:53:33,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:53:33,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:53:33,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:53:33,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:53:33,582 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:53:33,582 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:53:33,582 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:53:33,582 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:53:33,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:53:33,583 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:53:33,583 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:53:33,583 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:53:33,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:53:33,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:53:33,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:53:33,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:53:33,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:53:33,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:53:33,584 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:53:33,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:53:33,584 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:53:33,584 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:53:33,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:53:33,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:53:33,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:53:33,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:53:33,584 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 -> ee1bf5a100c560c161691455551c965071f499d9e9eea4cb62c63597da53f17e [2025-03-08 13:53:33,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:53:33,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:53:33,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:53:33,833 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:53:33,835 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:53:33,835 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-0.i [2025-03-08 13:53:34,988 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5482a65b/e4ab43a17e3b4663859efbd3237ba870/FLAG100b3eac6 [2025-03-08 13:53:35,198 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:53:35,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-0.i [2025-03-08 13:53:35,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5482a65b/e4ab43a17e3b4663859efbd3237ba870/FLAG100b3eac6 [2025-03-08 13:53:35,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5482a65b/e4ab43a17e3b4663859efbd3237ba870 [2025-03-08 13:53:35,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:53:35,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:53:35,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:53:35,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:53:35,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:53:35,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:53:35" (1/1) ... [2025-03-08 13:53:35,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e09995c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:35, skipping insertion in model container [2025-03-08 13:53:35,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:53:35" (1/1) ... [2025-03-08 13:53:35,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:53:35,681 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-0.i[915,928] [2025-03-08 13:53:35,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:53:35,750 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:53:35,757 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-0.i[915,928] [2025-03-08 13:53:35,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:53:35,804 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:53:35,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:35 WrapperNode [2025-03-08 13:53:35,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:53:35,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:53:35,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:53:35,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:53:35,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:35" (1/1) ... [2025-03-08 13:53:35,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:35" (1/1) ... [2025-03-08 13:53:35,851 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2025-03-08 13:53:35,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:53:35,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:53:35,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:53:35,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:53:35,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:35" (1/1) ... [2025-03-08 13:53:35,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:35" (1/1) ... [2025-03-08 13:53:35,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:35" (1/1) ... [2025-03-08 13:53:35,880 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:53:35,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:35" (1/1) ... [2025-03-08 13:53:35,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:35" (1/1) ... [2025-03-08 13:53:35,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:35" (1/1) ... [2025-03-08 13:53:35,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:35" (1/1) ... [2025-03-08 13:53:35,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:35" (1/1) ... [2025-03-08 13:53:35,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:35" (1/1) ... [2025-03-08 13:53:35,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:53:35,893 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:53:35,893 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:53:35,893 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:53:35,894 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:35" (1/1) ... [2025-03-08 13:53:35,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:53:35,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:53:35,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:53:35,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:53:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:53:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:53:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:53:35,949 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:53:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:53:35,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:53:36,029 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:53:36,031 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:53:52,240 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-08 13:53:52,240 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:53:52,269 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:53:52,269 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:53:52,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:53:52 BoogieIcfgContainer [2025-03-08 13:53:52,269 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:53:52,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:53:52,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:53:52,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:53:52,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:53:35" (1/3) ... [2025-03-08 13:53:52,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da839af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:53:52, skipping insertion in model container [2025-03-08 13:53:52,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:35" (2/3) ... [2025-03-08 13:53:52,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da839af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:53:52, skipping insertion in model container [2025-03-08 13:53:52,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:53:52" (3/3) ... [2025-03-08 13:53:52,279 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-0.i [2025-03-08 13:53:52,291 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:53:52,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-0.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:53:52,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:53:52,357 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;@13aede4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:53:52,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:53:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:53:52,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 13:53:52,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:53:52,373 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:53:52,373 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:53:52,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:53:52,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1461377659, now seen corresponding path program 1 times [2025-03-08 13:53:52,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:53:52,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239049729] [2025-03-08 13:53:52,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:53:52,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:53:52,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:53:52,394 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:53:52,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 13:53:52,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 13:53:52,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 13:53:52,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:53:52,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:53:53,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:53:53,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:53:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2025-03-08 13:53:53,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:53:53,056 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:53:53,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239049729] [2025-03-08 13:53:53,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239049729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:53:53,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:53:53,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:53:53,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457726366] [2025-03-08 13:53:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:53:53,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:53:53,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:53:53,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:53:53,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:53:53,079 INFO L87 Difference]: Start difference. First operand has 76 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 13:53:53,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:53:53,104 INFO L93 Difference]: Finished difference Result 148 states and 249 transitions. [2025-03-08 13:53:53,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:53:53,106 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 148 [2025-03-08 13:53:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:53:53,111 INFO L225 Difference]: With dead ends: 148 [2025-03-08 13:53:53,112 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 13:53:53,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:53:53,116 INFO L435 NwaCegarLoop]: 111 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, 111 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:53:53,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:53:53,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 13:53:53,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-08 13:53:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:53:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2025-03-08 13:53:53,154 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 148 [2025-03-08 13:53:53,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:53:53,155 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2025-03-08 13:53:53,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 13:53:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2025-03-08 13:53:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 13:53:53,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:53:53,158 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:53:53,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 13:53:53,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:53:53,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:53:53,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:53:53,360 INFO L85 PathProgramCache]: Analyzing trace with hash 728778051, now seen corresponding path program 1 times [2025-03-08 13:53:53,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:53:53,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656223607] [2025-03-08 13:53:53,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:53:53,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:53:53,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:53:53,365 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:53:53,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 13:53:53,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 13:53:53,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 13:53:53,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:53:53,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:53:53,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 13:53:53,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:53:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-08 13:53:54,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:53:54,479 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:53:54,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656223607] [2025-03-08 13:53:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656223607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:53:54,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:53:54,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 13:53:54,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463490452] [2025-03-08 13:53:54,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:53:54,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:53:54,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:53:54,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:53:54,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:53:54,484 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 13:54:00,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:54:04,338 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-08 13:54:08,343 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-08 13:54:12,350 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-08 13:54:16,356 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-08 13:54:18,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:54:18,549 INFO L93 Difference]: Finished difference Result 198 states and 287 transitions. [2025-03-08 13:54:18,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 13:54:18,549 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 148 [2025-03-08 13:54:18,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:54:18,551 INFO L225 Difference]: With dead ends: 198 [2025-03-08 13:54:18,551 INFO L226 Difference]: Without dead ends: 129 [2025-03-08 13:54:18,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-03-08 13:54:18,552 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 113 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 91 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:54:18,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 433 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 475 Invalid, 5 Unknown, 0 Unchecked, 23.3s Time] [2025-03-08 13:54:18,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-08 13:54:18,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 119. [2025-03-08 13:54:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 72 states have internal predecessors, (82), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 13:54:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2025-03-08 13:54:18,568 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 148 [2025-03-08 13:54:18,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:54:18,569 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2025-03-08 13:54:18,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 13:54:18,569 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2025-03-08 13:54:18,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 13:54:18,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:54:18,570 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:54:18,594 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-08 13:54:18,771 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-08 13:54:18,771 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:54:18,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:54:18,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1725850404, now seen corresponding path program 1 times [2025-03-08 13:54:18,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:54:18,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717375183] [2025-03-08 13:54:18,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:54:18,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:54:18,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:54:18,775 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-08 13:54:18,777 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-08 13:54:18,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 13:54:19,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 13:54:19,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:54:19,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:54:19,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-08 13:54:19,838 INFO L279 TraceCheckSpWp]: Computing forward predicates...