./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-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-?-8fc3dc6-m [2025-03-17 03:00:41,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:00:41,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:00:41,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:00:41,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:00:41,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:00:41,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:00:41,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:00:41,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:00:41,682 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:00:41,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:00:41,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:00:41,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:00:41,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:00:41,683 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:00:41,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:00:41,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:00:41,683 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:00:41,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:00:41,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:00:41,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:00:41,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:00:41,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:00:41,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:00:41,684 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:00:41,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:00:41,684 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:00:41,684 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:00:41,684 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:00:41,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:00:41,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:00:41,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:00:41,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:00:41,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:00:41,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:00:41,685 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:00:41,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:00:41,685 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:00:41,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:00:41,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:00:41,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:00:41,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:00:41,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:00:41,685 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-17 03:00:41,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:00:41,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:00:41,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:00:41,918 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:00:41,918 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:00:41,919 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-17 03:00:43,111 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3992f9d5c/0e9f16383443455a81d55ece12c97930/FLAGa4b9bc2f2 [2025-03-17 03:00:43,347 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:00:43,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-0.i [2025-03-17 03:00:43,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3992f9d5c/0e9f16383443455a81d55ece12c97930/FLAGa4b9bc2f2 [2025-03-17 03:00:43,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3992f9d5c/0e9f16383443455a81d55ece12c97930 [2025-03-17 03:00:43,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:00:43,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:00:43,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:00:43,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:00:43,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:00:43,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:00:43" (1/1) ... [2025-03-17 03:00:43,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71cf4d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:43, skipping insertion in model container [2025-03-17 03:00:43,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:00:43" (1/1) ... [2025-03-17 03:00:43,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:00:43,808 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-17 03:00:43,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:00:43,875 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:00:43,882 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-17 03:00:43,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:00:43,926 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:00:43,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:43 WrapperNode [2025-03-17 03:00:43,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:00:43,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:00:43,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:00:43,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:00:43,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:43" (1/1) ... [2025-03-17 03:00:43,940 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:43" (1/1) ... [2025-03-17 03:00:43,976 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2025-03-17 03:00:43,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:00:43,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:00:43,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:00:43,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:00:43,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:43" (1/1) ... [2025-03-17 03:00:43,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:43" (1/1) ... [2025-03-17 03:00:43,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:43" (1/1) ... [2025-03-17 03:00:44,021 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:00:44,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:43" (1/1) ... [2025-03-17 03:00:44,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:43" (1/1) ... [2025-03-17 03:00:44,032 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:43" (1/1) ... [2025-03-17 03:00:44,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:43" (1/1) ... [2025-03-17 03:00:44,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:43" (1/1) ... [2025-03-17 03:00:44,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:43" (1/1) ... [2025-03-17 03:00:44,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:00:44,042 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:00:44,043 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:00:44,043 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:00:44,044 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:43" (1/1) ... [2025-03-17 03:00:44,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:00:44,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:00:44,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:00:44,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:00:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:00:44,087 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:00:44,087 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:00:44,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:00:44,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:00:44,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:00:44,145 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:00:44,147 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:00:44,535 INFO L1322 $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-17 03:00:44,562 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-03-17 03:00:44,563 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:00:44,579 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:00:44,581 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:00:44,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:00:44 BoogieIcfgContainer [2025-03-17 03:00:44,581 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:00:44,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:00:44,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:00:44,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:00:44,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:00:43" (1/3) ... [2025-03-17 03:00:44,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53328b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:00:44, skipping insertion in model container [2025-03-17 03:00:44,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:43" (2/3) ... [2025-03-17 03:00:44,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53328b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:00:44, skipping insertion in model container [2025-03-17 03:00:44,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:00:44" (3/3) ... [2025-03-17 03:00:44,589 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-0.i [2025-03-17 03:00:44,600 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:00:44,601 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-0.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:00:44,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:00:44,652 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;@2076842c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:00:44,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:00:44,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 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-17 03:00:44,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 03:00:44,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:00:44,667 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] [2025-03-17 03:00:44,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:00:44,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:00:44,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1509116765, now seen corresponding path program 1 times [2025-03-17 03:00:44,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:00:44,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730051305] [2025-03-17 03:00:44,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:00:44,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:00:44,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 03:00:44,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 03:00:44,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:00:44,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:00:44,907 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-17 03:00:44,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:00:44,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730051305] [2025-03-17 03:00:44,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730051305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:00:44,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135502838] [2025-03-17 03:00:44,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:00:44,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:00:44,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:00:44,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:00:44,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:00:44,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 03:00:45,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 03:00:45,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:00:45,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:00:45,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:00:45,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:00:45,088 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-17 03:00:45,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:00:45,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135502838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:00:45,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:00:45,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:00:45,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392907465] [2025-03-17 03:00:45,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:00:45,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:00:45,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:00:45,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:00:45,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:00:45,113 INFO L87 Difference]: Start difference. First operand has 98 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 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.0) internal successors, (44), 2 states have internal predecessors, (44), 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-17 03:00:45,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:00:45,140 INFO L93 Difference]: Finished difference Result 185 states and 310 transitions. [2025-03-17 03:00:45,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:00:45,142 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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 149 [2025-03-17 03:00:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:00:45,148 INFO L225 Difference]: With dead ends: 185 [2025-03-17 03:00:45,149 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 03:00:45,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:00:45,154 INFO L435 NwaCegarLoop]: 130 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, 130 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-17 03:00:45,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:00:45,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 03:00:45,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-17 03:00:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 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-17 03:00:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 130 transitions. [2025-03-17 03:00:45,193 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 130 transitions. Word has length 149 [2025-03-17 03:00:45,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:00:45,194 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 130 transitions. [2025-03-17 03:00:45,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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-17 03:00:45,195 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 130 transitions. [2025-03-17 03:00:45,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 03:00:45,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:00:45,202 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] [2025-03-17 03:00:45,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:00:45,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:00:45,403 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:00:45,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:00:45,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1436170911, now seen corresponding path program 1 times [2025-03-17 03:00:45,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:00:45,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645689055] [2025-03-17 03:00:45,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:00:45,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:00:45,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 03:00:45,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 03:00:45,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:00:45,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:00:46,244 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-17 03:00:46,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:00:46,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645689055] [2025-03-17 03:00:46,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645689055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:00:46,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:00:46,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:00:46,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879964577] [2025-03-17 03:00:46,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:00:46,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:00:46,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:00:46,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:00:46,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:00:46,249 INFO L87 Difference]: Start difference. First operand 86 states and 130 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-17 03:00:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:00:46,589 INFO L93 Difference]: Finished difference Result 251 states and 376 transitions. [2025-03-17 03:00:46,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:00:46,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 149 [2025-03-17 03:00:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:00:46,591 INFO L225 Difference]: With dead ends: 251 [2025-03-17 03:00:46,591 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 03:00:46,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:00:46,592 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 219 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:00:46,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 312 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:00:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 03:00:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 120. [2025-03-17 03:00:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 95 states have internal predecessors, (132), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 03:00:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-03-17 03:00:46,617 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 149 [2025-03-17 03:00:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:00:46,618 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-03-17 03:00:46,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-17 03:00:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-03-17 03:00:46,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 03:00:46,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:00:46,621 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] [2025-03-17 03:00:46,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:00:46,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:00:46,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:00:46,622 INFO L85 PathProgramCache]: Analyzing trace with hash -925636734, now seen corresponding path program 1 times [2025-03-17 03:00:46,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:00:46,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884094768] [2025-03-17 03:00:46,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:00:46,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:00:46,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 03:00:46,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 03:00:46,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:00:46,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:00:46,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1500103498] [2025-03-17 03:00:46,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:00:46,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:00:46,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:00:46,789 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:00:46,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 03:00:46,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 03:00:46,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 03:00:46,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:00:46,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:00:46,894 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:00:46,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 03:00:46,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 03:00:46,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:00:46,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:00:47,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:00:47,026 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:00:47,026 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:00:47,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 03:00:47,229 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-17 03:00:47,232 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 03:00:47,322 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:00:47,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:00:47 BoogieIcfgContainer [2025-03-17 03:00:47,330 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:00:47,330 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:00:47,330 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:00:47,331 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:00:47,331 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:00:44" (3/4) ... [2025-03-17 03:00:47,333 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:00:47,333 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:00:47,334 INFO L158 Benchmark]: Toolchain (without parser) took 3648.83ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 66.1MB in the end (delta: 56.7MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2025-03-17 03:00:47,334 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:00:47,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.88ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 105.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:00:47,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.95ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 97.4MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:00:47,338 INFO L158 Benchmark]: Boogie Preprocessor took 63.61ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 86.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:00:47,338 INFO L158 Benchmark]: IcfgBuilder took 538.98ms. Allocated memory is still 167.8MB. Free memory was 86.6MB in the beginning and 42.4MB in the end (delta: 44.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 03:00:47,338 INFO L158 Benchmark]: TraceAbstraction took 2746.76ms. Allocated memory is still 167.8MB. Free memory was 41.8MB in the beginning and 66.1MB in the end (delta: -24.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:00:47,338 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 167.8MB. Free memory was 66.1MB in the beginning and 66.1MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:00:47,339 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.40ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.88ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 105.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.95ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 97.4MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.61ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 86.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 538.98ms. Allocated memory is still 167.8MB. Free memory was 86.6MB in the beginning and 42.4MB in the end (delta: 44.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2746.76ms. Allocated memory is still 167.8MB. Free memory was 41.8MB in the beginning and 66.1MB in the end (delta: -24.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 167.8MB. Free memory was 66.1MB in the beginning and 66.1MB in the end (delta: 30.1kB). 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 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, 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; [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 [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=-34, 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=-34, 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=-34, 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=-34, 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=-34, 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=-34, 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=-34, 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=-34, 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=-34, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, 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=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, 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=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, 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=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, 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=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, 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=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, 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=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, 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=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, 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=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, 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=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, 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=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_36=15/2, var_1_37=16, var_1_38=-509, var_1_39=3, 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=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_36=15/2, var_1_37=16, var_1_38=-509, var_1_39=3, 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=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=-509, var_1_39=3, 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=-93, 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=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=-509, var_1_39=3, 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=92, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=-509, var_1_39=3, 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=92, var_1_11=0, var_1_14=92, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=-509, var_1_39=3, 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=92, var_1_15=6, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=-509, var_1_39=3, 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=92, var_1_15=6, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=-509, var_1_39=3, 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=92, var_1_15=6, var_1_19=184, var_1_1=64, var_1_23=47/10, var_1_29=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=-509, var_1_39=3, 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=92, var_1_15=6, var_1_19=184, var_1_1=64, var_1_29=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=-509, var_1_39=3, 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=92, var_1_15=6, var_1_19=184, var_1_1=64, var_1_29=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=-509, var_1_39=3, 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=92, var_1_15=6, var_1_19=184, var_1_1=92, var_1_29=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=-509, var_1_39=3, 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=92, var_1_15=6, var_1_19=184, var_1_1=92, var_1_29=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=-509, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=3, 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=3, var_1_14=92, var_1_15=6, var_1_19=184, var_1_1=92, var_1_29=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=-509, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=3, 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=92, stepLocal_6=3, stepLocal_7=1, var_1_11=3, var_1_14=92, var_1_15=6, var_1_19=184, var_1_1=92, var_1_29=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=-509, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=3, 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=3, stepLocal_7=1, var_1_11=3, var_1_14=92, var_1_15=6, var_1_19=184, var_1_1=92, var_1_29=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=63, var_1_38=-509, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=3, 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=3, var_1_14=92, var_1_15=6, var_1_19=184, var_1_1=92, var_1_29=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=63, var_1_38=-509, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=3, 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=3, var_1_14=92, var_1_15=6, var_1_19=184, var_1_1=92, var_1_29=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=63, var_1_38=-509, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=3, 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=3, var_1_14=92, var_1_15=6, var_1_19=184, var_1_1=92, var_1_29=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=63, var_1_38=-509, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=3, var_1_8=1073741823] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=2, var_1_11=3, var_1_14=92, var_1_15=6, var_1_19=184, var_1_1=92, var_1_29=92, var_1_30=-34, var_1_31=-509, var_1_32=63, var_1_33=127, var_1_34=63, var_1_35=-193, var_1_37=63, var_1_38=-509, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=3, var_1_8=1073741823] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 175 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 219 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 219 mSDsluCounter, 442 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 145 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 194 IncrementalHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 297 mSDtfsCounter, 194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 46 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 444 ConstructedInterpolants, 0 QuantifiedInterpolants, 599 SizeOfPredicates, 0 NumberOfNonLiveVariables, 360 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-17 03:00:47,363 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-?-8fc3dc6-m [2025-03-17 03:00:49,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:00:49,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:00:49,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:00:49,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:00:49,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:00:49,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:00:49,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:00:49,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:00:49,335 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:00:49,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:00:49,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:00:49,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:00:49,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:00:49,336 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:00:49,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:00:49,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:00:49,336 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:00:49,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:00:49,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:00:49,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:00:49,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:00:49,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:00:49,336 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:00:49,336 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:00:49,337 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:00:49,337 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:00:49,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:00:49,337 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:00:49,337 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:00:49,337 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:00:49,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:00:49,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:00:49,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:00:49,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:00:49,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:00:49,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:00:49,338 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:00:49,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:00:49,338 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:00:49,338 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:00:49,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:00:49,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:00:49,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:00:49,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:00:49,338 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-17 03:00:49,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:00:49,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:00:49,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:00:49,568 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:00:49,568 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:00:49,569 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-17 03:00:50,742 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fcf21982/72a4c9287c6048acbffa54a1370ed04e/FLAG2a67414c0 [2025-03-17 03:00:50,993 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:00:50,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-0.i [2025-03-17 03:00:51,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fcf21982/72a4c9287c6048acbffa54a1370ed04e/FLAG2a67414c0 [2025-03-17 03:00:51,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fcf21982/72a4c9287c6048acbffa54a1370ed04e [2025-03-17 03:00:51,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:00:51,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:00:51,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:00:51,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:00:51,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:00:51,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:00:51" (1/1) ... [2025-03-17 03:00:51,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1acd7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51, skipping insertion in model container [2025-03-17 03:00:51,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:00:51" (1/1) ... [2025-03-17 03:00:51,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:00:51,447 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-17 03:00:51,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:00:51,512 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:00:51,519 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-17 03:00:51,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:00:51,559 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:00:51,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51 WrapperNode [2025-03-17 03:00:51,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:00:51,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:00:51,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:00:51,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:00:51,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 03:00:51,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 03:00:51,594 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2025-03-17 03:00:51,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:00:51,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:00:51,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:00:51,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:00:51,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 03:00:51,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 03:00:51,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 03:00:51,626 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:00:51,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 03:00:51,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 03:00:51,637 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 03:00:51,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 03:00:51,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 03:00:51,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 03:00:51,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:00:51,645 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:00:51,645 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:00:51,645 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:00:51,646 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 03:00:51,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:00:51,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:00:51,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:00:51,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:00:51,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:00:51,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:00:51,704 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:00:51,704 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:00:51,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:00:51,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:00:51,777 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:00:51,779 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:01:07,717 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-17 03:01:07,717 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:01:07,724 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:01:07,724 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:01:07,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:01:07 BoogieIcfgContainer [2025-03-17 03:01:07,725 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:01:07,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:01:07,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:01:07,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:01:07,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:00:51" (1/3) ... [2025-03-17 03:01:07,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11af3bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:01:07, skipping insertion in model container [2025-03-17 03:01:07,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (2/3) ... [2025-03-17 03:01:07,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11af3bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:01:07, skipping insertion in model container [2025-03-17 03:01:07,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:01:07" (3/3) ... [2025-03-17 03:01:07,731 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-0.i [2025-03-17 03:01:07,740 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:01:07,741 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-0.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:01:07,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:01:07,788 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;@56a6f030, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:01:07,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:01:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 47 states have internal predecessors, (67), 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-17 03:01:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 03:01:07,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:01:07,801 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] [2025-03-17 03:01:07,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:01:07,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:01:07,804 INFO L85 PathProgramCache]: Analyzing trace with hash 619427748, now seen corresponding path program 1 times [2025-03-17 03:01:07,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:01:07,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059185282] [2025-03-17 03:01:07,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:07,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:01:07,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:01:07,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:01:07,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 03:01:07,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 03:01:08,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 03:01:08,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:08,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:01:08,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:01:08,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:01:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-17 03:01:08,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:01:08,408 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:01:08,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059185282] [2025-03-17 03:01:08,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059185282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:01:08,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:01:08,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:01:08,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661498994] [2025-03-17 03:01:08,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:01:08,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:01:08,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:01:08,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:01:08,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:01:08,432 INFO L87 Difference]: Start difference. First operand has 71 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 47 states have internal predecessors, (67), 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 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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-17 03:01:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:01:08,456 INFO L93 Difference]: Finished difference Result 140 states and 241 transitions. [2025-03-17 03:01:08,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:01:08,458 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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 144 [2025-03-17 03:01:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:01:08,463 INFO L225 Difference]: With dead ends: 140 [2025-03-17 03:01:08,464 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 03:01:08,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:01:08,471 INFO L435 NwaCegarLoop]: 106 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, 106 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:01:08,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:01:08,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 03:01:08,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-17 03:01:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 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-17 03:01:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2025-03-17 03:01:08,510 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 144 [2025-03-17 03:01:08,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:01:08,510 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2025-03-17 03:01:08,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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-17 03:01:08,513 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2025-03-17 03:01:08,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 03:01:08,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:01:08,519 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] [2025-03-17 03:01:08,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 03:01:08,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:01:08,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:01:08,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:01:08,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1665226714, now seen corresponding path program 1 times [2025-03-17 03:01:08,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:01:08,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036815315] [2025-03-17 03:01:08,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:08,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:01:08,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:01:08,727 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:01:08,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 03:01:08,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 03:01:09,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 03:01:09,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:09,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:01:09,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 03:01:09,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:01:10,119 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-17 03:01:10,119 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:01:10,120 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:01:10,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036815315] [2025-03-17 03:01:10,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036815315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:01:10,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:01:10,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:01:10,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353388673] [2025-03-17 03:01:10,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:01:10,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:01:10,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:01:10,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:01:10,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:01:10,123 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 8 states have internal predecessors, (43), 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-17 03:01:16,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:01:20,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:01:24,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:01:28,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:01:32,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:01:36,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:01:38,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:01:38,140 INFO L93 Difference]: Finished difference Result 191 states and 280 transitions. [2025-03-17 03:01:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 03:01:38,141 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 8 states have internal predecessors, (43), 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 144 [2025-03-17 03:01:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:01:38,143 INFO L225 Difference]: With dead ends: 191 [2025-03-17 03:01:38,143 INFO L226 Difference]: Without dead ends: 124 [2025-03-17 03:01:38,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2025-03-17 03:01:38,144 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 149 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 132 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:01:38,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 371 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 410 Invalid, 6 Unknown, 0 Unchecked, 27.1s Time] [2025-03-17 03:01:38,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-17 03:01:38,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2025-03-17 03:01:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 67 states have internal predecessors, (76), 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-17 03:01:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2025-03-17 03:01:38,177 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 144 [2025-03-17 03:01:38,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:01:38,177 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2025-03-17 03:01:38,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 8 states have internal predecessors, (43), 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-17 03:01:38,177 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2025-03-17 03:01:38,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 03:01:38,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:01:38,182 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] [2025-03-17 03:01:38,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 03:01:38,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:01:38,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:01:38,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:01:38,384 INFO L85 PathProgramCache]: Analyzing trace with hash 131724645, now seen corresponding path program 1 times [2025-03-17 03:01:38,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:01:38,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836717819] [2025-03-17 03:01:38,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:38,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:01:38,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:01:38,390 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:01:38,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 03:01:38,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 03:01:39,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 03:01:39,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:39,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:01:39,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-17 03:01:39,691 INFO L279 TraceCheckSpWp]: Computing forward predicates...