./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-66.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 c37a39e3553d97b9437718bbedaac5bd18bbf82294e1487f72d36703f09800e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:49:51,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:49:51,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 00:49:51,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:49:51,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:49:51,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:49:51,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:49:51,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:49:51,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:49:51,962 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:49:51,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:49:51,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:49:51,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:49:51,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:49:51,963 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:49:51,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:49:51,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:49:51,964 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:49:51,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:49:51,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:49:51,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:49:51,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:49:51,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:49:51,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:49:51,964 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:49:51,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:49:51,965 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:49:51,965 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:49:51,965 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:49:51,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:49:51,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:49:51,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:49:51,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:49:51,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:49:51,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:49:51,965 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:49:51,965 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:49:51,965 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:49:51,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:49:51,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:49:51,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:49:51,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:49:51,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:49:51,966 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-jdk21/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 -> c37a39e3553d97b9437718bbedaac5bd18bbf82294e1487f72d36703f09800e5 [2025-02-06 00:49:52,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:49:52,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:49:52,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:49:52,219 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:49:52,219 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:49:52,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-66.i [2025-02-06 00:49:53,394 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fc09ca6d/3a0f7d9eedf34c98bbf51c3f6599139f/FLAGbf0dbd902 [2025-02-06 00:49:53,618 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:49:53,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-66.i [2025-02-06 00:49:53,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fc09ca6d/3a0f7d9eedf34c98bbf51c3f6599139f/FLAGbf0dbd902 [2025-02-06 00:49:53,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fc09ca6d/3a0f7d9eedf34c98bbf51c3f6599139f [2025-02-06 00:49:53,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:49:53,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:49:53,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:49:53,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:49:53,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:49:53,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:49:53" (1/1) ... [2025-02-06 00:49:53,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@234288ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:53, skipping insertion in model container [2025-02-06 00:49:53,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:49:53" (1/1) ... [2025-02-06 00:49:53,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:49:54,056 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-66.i[916,929] [2025-02-06 00:49:54,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:49:54,115 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:49:54,122 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-66.i[916,929] [2025-02-06 00:49:54,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:49:54,169 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:49:54,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:54 WrapperNode [2025-02-06 00:49:54,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:49:54,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:49:54,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:49:54,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:49:54,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:54" (1/1) ... [2025-02-06 00:49:54,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:54" (1/1) ... [2025-02-06 00:49:54,223 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2025-02-06 00:49:54,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:49:54,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:49:54,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:49:54,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:49:54,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:54" (1/1) ... [2025-02-06 00:49:54,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:54" (1/1) ... [2025-02-06 00:49:54,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:54" (1/1) ... [2025-02-06 00:49:54,250 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-02-06 00:49:54,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:54" (1/1) ... [2025-02-06 00:49:54,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:54" (1/1) ... [2025-02-06 00:49:54,256 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:54" (1/1) ... [2025-02-06 00:49:54,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:54" (1/1) ... [2025-02-06 00:49:54,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:54" (1/1) ... [2025-02-06 00:49:54,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:54" (1/1) ... [2025-02-06 00:49:54,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:49:54,261 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:49:54,262 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:49:54,262 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:49:54,262 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:54" (1/1) ... [2025-02-06 00:49:54,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:49:54,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:49:54,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 00:49:54,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 00:49:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:49:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:49:54,316 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:49:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:49:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:49:54,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:49:54,382 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:49:54,384 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:49:54,647 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L197: havoc property_#t~ite19#1;havoc property_#t~bitwise18#1;havoc property_#t~short20#1; [2025-02-06 00:49:54,673 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-02-06 00:49:54,673 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:49:54,687 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:49:54,688 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:49:54,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:49:54 BoogieIcfgContainer [2025-02-06 00:49:54,688 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:49:54,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:49:54,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:49:54,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:49:54,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:49:53" (1/3) ... [2025-02-06 00:49:54,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5465deab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:49:54, skipping insertion in model container [2025-02-06 00:49:54,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:54" (2/3) ... [2025-02-06 00:49:54,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5465deab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:49:54, skipping insertion in model container [2025-02-06 00:49:54,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:49:54" (3/3) ... [2025-02-06 00:49:54,696 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-66.i [2025-02-06 00:49:54,708 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:49:54,710 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-66.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:49:54,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:49:54,763 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;@1b66f27c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:49:54,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:49:54,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 66 states have internal predecessors, (95), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 00:49:54,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 00:49:54,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:54,778 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:49:54,778 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:54,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:54,782 INFO L85 PathProgramCache]: Analyzing trace with hash -855332433, now seen corresponding path program 1 times [2025-02-06 00:49:54,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:54,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327729334] [2025-02-06 00:49:54,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:54,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:54,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 00:49:54,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 00:49:54,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:54,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-02-06 00:49:55,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:55,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327729334] [2025-02-06 00:49:55,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327729334] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:49:55,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692391771] [2025-02-06 00:49:55,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:55,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:49:55,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:49:55,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:49:55,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 00:49:55,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 00:49:55,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 00:49:55,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:55,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:55,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:49:55,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:49:55,249 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-02-06 00:49:55,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:49:55,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692391771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:49:55,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:49:55,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:49:55,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197334679] [2025-02-06 00:49:55,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:49:55,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:49:55,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:55,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:49:55,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:49:55,272 INFO L87 Difference]: Start difference. First operand has 89 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 66 states have internal predecessors, (95), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 00:49:55,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:55,300 INFO L93 Difference]: Finished difference Result 175 states and 292 transitions. [2025-02-06 00:49:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:49:55,301 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 149 [2025-02-06 00:49:55,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:55,305 INFO L225 Difference]: With dead ends: 175 [2025-02-06 00:49:55,306 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 00:49:55,308 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-02-06 00:49:55,309 INFO L435 NwaCegarLoop]: 133 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, 133 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-02-06 00:49:55,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:49:55,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 00:49:55,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-06 00:49:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 63 states have internal predecessors, (90), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 00:49:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 132 transitions. [2025-02-06 00:49:55,337 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 132 transitions. Word has length 149 [2025-02-06 00:49:55,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:55,338 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 132 transitions. [2025-02-06 00:49:55,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 00:49:55,338 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 132 transitions. [2025-02-06 00:49:55,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 00:49:55,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:55,342 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:49:55,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 00:49:55,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 00:49:55,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:55,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:55,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1954011438, now seen corresponding path program 1 times [2025-02-06 00:49:55,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:55,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965769800] [2025-02-06 00:49:55,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:55,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:55,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 00:49:55,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 00:49:55,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:55,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 00:49:55,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:55,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965769800] [2025-02-06 00:49:55,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965769800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:49:55,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:49:55,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:49:55,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856576854] [2025-02-06 00:49:55,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:49:55,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:49:55,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:55,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:49:55,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:49:55,797 INFO L87 Difference]: Start difference. First operand 86 states and 132 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 00:49:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:55,849 INFO L93 Difference]: Finished difference Result 209 states and 323 transitions. [2025-02-06 00:49:55,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:49:55,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 149 [2025-02-06 00:49:55,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:55,851 INFO L225 Difference]: With dead ends: 209 [2025-02-06 00:49:55,851 INFO L226 Difference]: Without dead ends: 126 [2025-02-06 00:49:55,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:49:55,879 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 61 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:49:55,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 244 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:49:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-06 00:49:55,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 104. [2025-02-06 00:49:55,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 81 states have internal predecessors, (119), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 00:49:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 161 transitions. [2025-02-06 00:49:55,894 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 161 transitions. Word has length 149 [2025-02-06 00:49:55,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:55,895 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 161 transitions. [2025-02-06 00:49:55,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 00:49:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 161 transitions. [2025-02-06 00:49:55,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 00:49:55,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:55,899 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:49:55,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:49:55,899 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:55,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:55,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2021018191, now seen corresponding path program 1 times [2025-02-06 00:49:55,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:55,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067345556] [2025-02-06 00:49:55,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:55,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:55,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 00:49:56,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 00:49:56,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:56,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-06 00:49:56,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:56,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067345556] [2025-02-06 00:49:56,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067345556] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:49:56,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497332738] [2025-02-06 00:49:56,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:56,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:49:56,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:49:56,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:49:56,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 00:49:56,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 00:49:56,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 00:49:56,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:56,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:56,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 00:49:56,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:49:57,393 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 134 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 00:49:57,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:49:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-06 00:49:57,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497332738] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:49:57,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:49:57,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 16 [2025-02-06 00:49:57,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304274180] [2025-02-06 00:49:57,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:49:57,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 00:49:57,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:57,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 00:49:57,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-02-06 00:49:57,810 INFO L87 Difference]: Start difference. First operand 104 states and 161 transitions. Second operand has 16 states, 16 states have (on average 8.0) internal successors, (128), 16 states have internal predecessors, (128), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 5 states have call predecessors, (63), 6 states have call successors, (63) [2025-02-06 00:49:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:58,921 INFO L93 Difference]: Finished difference Result 527 states and 803 transitions. [2025-02-06 00:49:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-06 00:49:58,923 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.0) internal successors, (128), 16 states have internal predecessors, (128), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 5 states have call predecessors, (63), 6 states have call successors, (63) Word has length 149 [2025-02-06 00:49:58,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:58,926 INFO L225 Difference]: With dead ends: 527 [2025-02-06 00:49:58,928 INFO L226 Difference]: Without dead ends: 426 [2025-02-06 00:49:58,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=428, Invalid=1552, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 00:49:58,932 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 744 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 00:49:58,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 685 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 00:49:58,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-02-06 00:49:58,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 322. [2025-02-06 00:49:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 250 states have (on average 1.424) internal successors, (356), 250 states have internal predecessors, (356), 63 states have call successors, (63), 8 states have call predecessors, (63), 8 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 00:49:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 482 transitions. [2025-02-06 00:49:58,986 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 482 transitions. Word has length 149 [2025-02-06 00:49:58,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:58,986 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 482 transitions. [2025-02-06 00:49:58,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.0) internal successors, (128), 16 states have internal predecessors, (128), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 5 states have call predecessors, (63), 6 states have call successors, (63) [2025-02-06 00:49:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 482 transitions. [2025-02-06 00:49:58,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 00:49:58,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:58,991 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:49:59,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 00:49:59,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:49:59,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:59,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:59,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1994207599, now seen corresponding path program 1 times [2025-02-06 00:49:59,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:59,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921394149] [2025-02-06 00:49:59,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:59,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:59,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 00:49:59,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 00:49:59,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:59,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 00:49:59,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:59,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921394149] [2025-02-06 00:49:59,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921394149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:49:59,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:49:59,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:49:59,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322449188] [2025-02-06 00:49:59,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:49:59,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:49:59,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:59,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:49:59,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:49:59,443 INFO L87 Difference]: Start difference. First operand 322 states and 482 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 00:49:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:59,478 INFO L93 Difference]: Finished difference Result 641 states and 961 transitions. [2025-02-06 00:49:59,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:49:59,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 149 [2025-02-06 00:49:59,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:59,482 INFO L225 Difference]: With dead ends: 641 [2025-02-06 00:49:59,483 INFO L226 Difference]: Without dead ends: 322 [2025-02-06 00:49:59,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:49:59,485 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:49:59,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 118 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:49:59,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-02-06 00:49:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2025-02-06 00:49:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 250 states have (on average 1.376) internal successors, (344), 250 states have internal predecessors, (344), 63 states have call successors, (63), 8 states have call predecessors, (63), 8 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 00:49:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 470 transitions. [2025-02-06 00:49:59,520 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 470 transitions. Word has length 149 [2025-02-06 00:49:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:59,521 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 470 transitions. [2025-02-06 00:49:59,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 00:49:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 470 transitions. [2025-02-06 00:49:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 00:49:59,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:59,524 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:49:59,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 00:49:59,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:59,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:59,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1402421233, now seen corresponding path program 1 times [2025-02-06 00:49:59,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:59,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934776402] [2025-02-06 00:49:59,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:59,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:59,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 00:49:59,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 00:49:59,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:59,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 00:49:59,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:59,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934776402] [2025-02-06 00:49:59,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934776402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:49:59,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:49:59,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:49:59,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786485511] [2025-02-06 00:49:59,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:49:59,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:49:59,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:59,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:49:59,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:49:59,712 INFO L87 Difference]: Start difference. First operand 322 states and 470 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 00:49:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:59,779 INFO L93 Difference]: Finished difference Result 641 states and 937 transitions. [2025-02-06 00:49:59,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:49:59,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 149 [2025-02-06 00:49:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:59,781 INFO L225 Difference]: With dead ends: 641 [2025-02-06 00:49:59,782 INFO L226 Difference]: Without dead ends: 322 [2025-02-06 00:49:59,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:49:59,783 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 78 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:49:59,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 231 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:49:59,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-02-06 00:49:59,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2025-02-06 00:49:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 250 states have (on average 1.352) internal successors, (338), 250 states have internal predecessors, (338), 63 states have call successors, (63), 8 states have call predecessors, (63), 8 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 00:49:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 464 transitions. [2025-02-06 00:49:59,803 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 464 transitions. Word has length 149 [2025-02-06 00:49:59,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:59,803 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 464 transitions. [2025-02-06 00:49:59,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 00:49:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 464 transitions. [2025-02-06 00:49:59,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 00:49:59,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:59,805 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:49:59,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 00:49:59,805 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:59,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:59,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1744405300, now seen corresponding path program 1 times [2025-02-06 00:49:59,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:59,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505465189] [2025-02-06 00:49:59,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:59,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:59,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 00:49:59,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 00:49:59,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:59,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-06 00:50:00,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:50:00,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505465189] [2025-02-06 00:50:00,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505465189] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:50:00,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967528278] [2025-02-06 00:50:00,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:00,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:50:00,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:50:00,258 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:50:00,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 00:50:00,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 00:50:00,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 00:50:00,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:00,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:00,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 00:50:00,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:50:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 284 proven. 48 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-02-06 00:50:00,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:50:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-06 00:50:00,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967528278] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:50:00,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:50:00,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 20 [2025-02-06 00:50:00,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503492758] [2025-02-06 00:50:00,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:50:00,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 00:50:00,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:50:00,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 00:50:00,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-02-06 00:50:00,911 INFO L87 Difference]: Start difference. First operand 322 states and 464 transitions. Second operand has 20 states, 20 states have (on average 6.65) internal successors, (133), 20 states have internal predecessors, (133), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2025-02-06 00:50:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:03,519 INFO L93 Difference]: Finished difference Result 2701 states and 3643 transitions. [2025-02-06 00:50:03,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-02-06 00:50:03,520 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.65) internal successors, (133), 20 states have internal predecessors, (133), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) Word has length 151 [2025-02-06 00:50:03,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:03,529 INFO L225 Difference]: With dead ends: 2701 [2025-02-06 00:50:03,529 INFO L226 Difference]: Without dead ends: 2382 [2025-02-06 00:50:03,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3492 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1672, Invalid=7834, Unknown=0, NotChecked=0, Total=9506 [2025-02-06 00:50:03,532 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 2508 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2508 SdHoareTripleChecker+Valid, 1769 SdHoareTripleChecker+Invalid, 2416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:03,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2508 Valid, 1769 Invalid, 2416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 00:50:03,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2025-02-06 00:50:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 1837. [2025-02-06 00:50:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1474 states have (on average 1.305291723202171) internal successors, (1924), 1492 states have internal predecessors, (1924), 282 states have call successors, (282), 80 states have call predecessors, (282), 80 states have return successors, (282), 264 states have call predecessors, (282), 282 states have call successors, (282) [2025-02-06 00:50:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2488 transitions. [2025-02-06 00:50:03,647 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2488 transitions. Word has length 151 [2025-02-06 00:50:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:03,647 INFO L471 AbstractCegarLoop]: Abstraction has 1837 states and 2488 transitions. [2025-02-06 00:50:03,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.65) internal successors, (133), 20 states have internal predecessors, (133), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2025-02-06 00:50:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2488 transitions. [2025-02-06 00:50:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 00:50:03,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:03,649 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 00:50:03,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 00:50:03,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:50:03,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:03,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:03,855 INFO L85 PathProgramCache]: Analyzing trace with hash -225446018, now seen corresponding path program 1 times [2025-02-06 00:50:03,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:03,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086702421] [2025-02-06 00:50:03,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:03,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:03,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 00:50:03,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 00:50:03,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:03,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 15 proven. 99 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2025-02-06 00:50:04,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:50:04,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086702421] [2025-02-06 00:50:04,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086702421] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:50:04,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492851808] [2025-02-06 00:50:04,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:04,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:50:04,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:50:04,347 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:50:04,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 00:50:04,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 00:50:04,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 00:50:04,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:04,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:04,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 00:50:04,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:50:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 234 proven. 180 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-02-06 00:50:05,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:50:06,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492851808] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:50:06,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 00:50:06,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 27 [2025-02-06 00:50:06,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140362213] [2025-02-06 00:50:06,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 00:50:06,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 00:50:06,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:50:06,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 00:50:06,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1357, Unknown=0, NotChecked=0, Total=1640 [2025-02-06 00:50:06,761 INFO L87 Difference]: Start difference. First operand 1837 states and 2488 transitions. Second operand has 27 states, 26 states have (on average 4.0) internal successors, (104), 24 states have internal predecessors, (104), 8 states have call successors, (42), 6 states have call predecessors, (42), 8 states have return successors, (42), 7 states have call predecessors, (42), 8 states have call successors, (42) [2025-02-06 00:50:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:09,499 INFO L93 Difference]: Finished difference Result 5920 states and 7881 transitions. [2025-02-06 00:50:09,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-02-06 00:50:09,500 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.0) internal successors, (104), 24 states have internal predecessors, (104), 8 states have call successors, (42), 6 states have call predecessors, (42), 8 states have return successors, (42), 7 states have call predecessors, (42), 8 states have call successors, (42) Word has length 152 [2025-02-06 00:50:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:09,516 INFO L225 Difference]: With dead ends: 5920 [2025-02-06 00:50:09,516 INFO L226 Difference]: Without dead ends: 4086 [2025-02-06 00:50:09,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2834 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2252, Invalid=8878, Unknown=0, NotChecked=0, Total=11130 [2025-02-06 00:50:09,523 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 695 mSDsluCounter, 2359 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 2585 SdHoareTripleChecker+Invalid, 1939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:09,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 2585 Invalid, 1939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1824 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 00:50:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4086 states. [2025-02-06 00:50:09,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4086 to 3696. [2025-02-06 00:50:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 2953 states have (on average 1.2956315611242804) internal successors, (3826), 2989 states have internal predecessors, (3826), 564 states have call successors, (564), 178 states have call predecessors, (564), 178 states have return successors, (564), 528 states have call predecessors, (564), 564 states have call successors, (564) [2025-02-06 00:50:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 4954 transitions. [2025-02-06 00:50:09,765 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 4954 transitions. Word has length 152 [2025-02-06 00:50:09,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:09,766 INFO L471 AbstractCegarLoop]: Abstraction has 3696 states and 4954 transitions. [2025-02-06 00:50:09,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.0) internal successors, (104), 24 states have internal predecessors, (104), 8 states have call successors, (42), 6 states have call predecessors, (42), 8 states have return successors, (42), 7 states have call predecessors, (42), 8 states have call successors, (42) [2025-02-06 00:50:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 4954 transitions. [2025-02-06 00:50:09,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 00:50:09,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:09,770 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:09,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 00:50:09,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 00:50:09,971 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:09,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:09,971 INFO L85 PathProgramCache]: Analyzing trace with hash -290090146, now seen corresponding path program 1 times [2025-02-06 00:50:09,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:09,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180425156] [2025-02-06 00:50:09,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:09,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:09,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 00:50:10,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 00:50:10,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:10,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-06 00:50:10,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:50:10,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180425156] [2025-02-06 00:50:10,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180425156] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:50:10,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102554685] [2025-02-06 00:50:10,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:10,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:50:10,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:50:10,205 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:50:10,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 00:50:10,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 00:50:10,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 00:50:10,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:10,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:10,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 00:50:10,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:50:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2025-02-06 00:50:10,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:50:10,946 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-06 00:50:10,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102554685] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:50:10,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:50:10,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-06 00:50:10,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187184462] [2025-02-06 00:50:10,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:50:10,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 00:50:10,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:50:10,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 00:50:10,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:50:10,948 INFO L87 Difference]: Start difference. First operand 3696 states and 4954 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 3 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-02-06 00:50:11,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:11,277 INFO L93 Difference]: Finished difference Result 7523 states and 10066 transitions. [2025-02-06 00:50:11,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 00:50:11,277 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 3 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) Word has length 152 [2025-02-06 00:50:11,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:11,292 INFO L225 Difference]: With dead ends: 7523 [2025-02-06 00:50:11,292 INFO L226 Difference]: Without dead ends: 3830 [2025-02-06 00:50:11,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-02-06 00:50:11,300 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 95 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:11,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 473 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:50:11,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3830 states. [2025-02-06 00:50:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3830 to 3696. [2025-02-06 00:50:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 2953 states have (on average 1.2773450728073146) internal successors, (3772), 2989 states have internal predecessors, (3772), 564 states have call successors, (564), 178 states have call predecessors, (564), 178 states have return successors, (564), 528 states have call predecessors, (564), 564 states have call successors, (564) [2025-02-06 00:50:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 4900 transitions. [2025-02-06 00:50:11,507 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 4900 transitions. Word has length 152 [2025-02-06 00:50:11,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:11,508 INFO L471 AbstractCegarLoop]: Abstraction has 3696 states and 4900 transitions. [2025-02-06 00:50:11,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 3 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-02-06 00:50:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 4900 transitions. [2025-02-06 00:50:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 00:50:11,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:11,512 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:11,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 00:50:11,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:50:11,713 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:11,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1452720189, now seen corresponding path program 1 times [2025-02-06 00:50:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:11,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349166866] [2025-02-06 00:50:11,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:11,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:11,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 00:50:11,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 00:50:11,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:11,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 00:50:11,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [431598969] [2025-02-06 00:50:11,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:11,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:50:11,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:50:11,797 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:50:11,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 00:50:11,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 00:50:11,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 00:50:11,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:11,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:50:11,911 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 00:50:11,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 00:50:11,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 00:50:11,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:11,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:50:12,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 00:50:12,029 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 00:50:12,029 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 00:50:12,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 00:50:12,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-06 00:50:12,234 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:12,324 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 00:50:12,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:50:12 BoogieIcfgContainer [2025-02-06 00:50:12,331 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 00:50:12,331 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 00:50:12,331 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 00:50:12,331 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 00:50:12,332 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:49:54" (3/4) ... [2025-02-06 00:50:12,333 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 00:50:12,334 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 00:50:12,334 INFO L158 Benchmark]: Toolchain (without parser) took 18374.88ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 111.0MB in the beginning and 371.4MB in the end (delta: -260.4MB). Peak memory consumption was 233.8MB. Max. memory is 16.1GB. [2025-02-06 00:50:12,335 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:50:12,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.54ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 94.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 00:50:12,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.21ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 91.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:50:12,336 INFO L158 Benchmark]: Boogie Preprocessor took 37.08ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 85.1MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:50:12,337 INFO L158 Benchmark]: IcfgBuilder took 426.73ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 55.8MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 00:50:12,337 INFO L158 Benchmark]: TraceAbstraction took 17641.08ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 55.0MB in the beginning and 371.5MB in the end (delta: -316.5MB). Peak memory consumption was 175.1MB. Max. memory is 16.1GB. [2025-02-06 00:50:12,337 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 637.5MB. Free memory was 371.5MB in the beginning and 371.4MB in the end (delta: 126.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:50:12,338 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.15ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.54ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 94.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.21ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 91.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.08ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 85.1MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 426.73ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 55.8MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17641.08ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 55.0MB in the beginning and 371.5MB in the end (delta: -316.5MB). Peak memory consumption was 175.1MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 637.5MB. Free memory was 371.5MB in the beginning and 371.4MB in the end (delta: 126.2kB). 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 shiftLeft at line 116, overapproximation of someBinaryArithmeticDOUBLEoperation at line 94, overapproximation of someBinaryArithmeticDOUBLEoperation at line 148, overapproximation of someBinaryArithmeticDOUBLEoperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 197, overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of someBinaryFLOATComparisonOperation at line 197, overapproximation of someBinaryFLOATComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 172, overapproximation of someBinaryDOUBLEComparisonOperation at line 170, overapproximation of someBinaryDOUBLEComparisonOperation at line 197. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 64; [L23] unsigned short int var_1_5 = 63575; [L24] unsigned long int var_1_6 = 10; [L25] unsigned long int var_1_8 = 3366149252; [L26] signed long int var_1_9 = -10; [L27] signed long int var_1_11 = 1938698816; [L28] unsigned char var_1_12 = 5; [L29] unsigned char var_1_13 = 64; [L30] unsigned char var_1_14 = 64; [L31] double var_1_15 = 99.625; [L32] double var_1_16 = 0.0; [L33] double var_1_17 = 999.5; [L34] double var_1_18 = 9.35; [L35] float var_1_19 = 99.875; [L36] float var_1_20 = 10000.71; [L37] double var_1_21 = 1000.5; [L38] double var_1_23 = 15.25; [L39] signed long int var_1_24 = 8; [L40] unsigned short int var_1_25 = 32; [L41] signed short int var_1_26 = 2; [L42] unsigned char var_1_27 = 0; [L43] unsigned char var_1_28 = 0; [L44] unsigned char var_1_29 = 0; [L45] unsigned char var_1_30 = 1; [L46] unsigned char var_1_32 = 0; [L47] float var_1_33 = 64.75; [L48] float var_1_34 = 9.2; [L49] unsigned short int last_1_var_1_1 = 64; [L50] signed long int last_1_var_1_9 = -10; [L51] unsigned char last_1_var_1_12 = 5; [L52] signed long int last_1_var_1_24 = 8; [L53] unsigned short int last_1_var_1_25 = 32; [L54] unsigned char last_1_var_1_27 = 0; [L55] unsigned char last_1_var_1_29 = 0; VAL [isInitial=0, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=63575, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L201] isInitial = 1 [L202] FCALL initially() [L203] int k_loop; [L204] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=63575, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L204] COND TRUE k_loop < 1 [L205] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_9 = var_1_9 [L190] last_1_var_1_12 = var_1_12 [L191] last_1_var_1_24 = var_1_24 [L192] last_1_var_1_25 = var_1_25 [L193] last_1_var_1_27 = var_1_27 [L194] last_1_var_1_29 = var_1_29 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=63575, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L205] RET updateLastVariables() [L206] CALL updateVariables() [L152] var_1_5 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_5 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L153] RET assume_abort_if_not(var_1_5 >= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L154] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L154] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L155] var_1_8 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_8 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L156] RET assume_abort_if_not(var_1_8 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L157] CALL assume_abort_if_not(var_1_8 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L157] RET assume_abort_if_not(var_1_8 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L158] var_1_11 = __VERIFIER_nondet_long() [L159] CALL assume_abort_if_not(var_1_11 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L159] RET assume_abort_if_not(var_1_11 >= 1073741822) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L160] CALL assume_abort_if_not(var_1_11 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L160] RET assume_abort_if_not(var_1_11 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L161] var_1_13 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L162] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L163] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L163] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L164] var_1_14 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_14 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L165] RET assume_abort_if_not(var_1_14 >= 63) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L166] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L166] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L167] var_1_16 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L168] RET assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L169] var_1_17 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L170] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L171] var_1_18 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L172] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L173] var_1_20 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L174] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L175] var_1_28 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L176] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L177] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L177] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L178] var_1_30 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L179] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L180] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L180] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L181] var_1_32 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L182] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L183] CALL assume_abort_if_not(var_1_32 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L183] RET assume_abort_if_not(var_1_32 <= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L184] var_1_34 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L185] RET assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L206] RET updateVariables() [L207] CALL step() [L59] signed long int stepLocal_8 = 10000000; [L60] unsigned long int stepLocal_7 = 128u + last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_7=192, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L61] COND FALSE !(last_1_var_1_24 >= stepLocal_7) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=-10] [L66] COND FALSE !(\read(last_1_var_1_29)) [L73] var_1_9 = ((var_1_11 - 16) - last_1_var_1_24) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=1073741798] [L75] COND FALSE !(\read(last_1_var_1_29)) [L78] var_1_12 = (32 + ((((var_1_14 - 2) < 0 ) ? -(var_1_14 - 2) : (var_1_14 - 2)))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=1073741798] [L80] unsigned char stepLocal_4 = var_1_14; [L81] unsigned char stepLocal_3 = last_1_var_1_27; [L82] unsigned char stepLocal_2 = last_1_var_1_27; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_4=-193, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=1073741798] [L83] COND TRUE (var_1_13 * (var_1_5 * last_1_var_1_9)) <= stepLocal_4 [L84] var_1_24 = 50 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=1073741798] [L94] var_1_15 = ((var_1_16 - var_1_17) - var_1_18) [L95] unsigned long int stepLocal_9 = 50u; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, stepLocal_9=50, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=1073741798] [L96] COND FALSE !(stepLocal_9 >= var_1_5) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=1073741798] [L99] COND FALSE !(\read(var_1_27)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=1073741798] [L102] signed short int stepLocal_1 = var_1_26; [L103] signed long int stepLocal_0 = var_1_24; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_1=2, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=1073741798] [L104] COND FALSE !(stepLocal_1 >= (var_1_26 + (var_1_14 * 16))) [L109] var_1_21 = (((((1.75) < (var_1_18)) ? (1.75) : (var_1_18))) - (9.9999999995E9 + var_1_17)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=1073741798] [L111] signed long int stepLocal_11 = (((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14)); [L112] unsigned char stepLocal_10 = var_1_27; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_10=0, stepLocal_11=63, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=1073741798] [L113] COND FALSE !(var_1_28 && stepLocal_10) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_11=63, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=1073741798] [L116] EXPR -25 << var_1_9 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_11=63, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=1073741798] [L116] COND TRUE stepLocal_11 > (-25 << var_1_9) [L117] var_1_29 = (var_1_27 || var_1_28) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=1073741798] [L122] COND FALSE !(last_1_var_1_12 >= last_1_var_1_24) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=1073741798] [L127] unsigned char stepLocal_12 = var_1_26 > var_1_1; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_12=0, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-255, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=1073741798] [L128] COND FALSE !(var_1_32 || stepLocal_12) [L131] var_1_33 = var_1_16 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-255, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=10, var_1_8=6442450943, var_1_9=1073741798] [L133] COND TRUE (var_1_33 * 8.2) < 10.4 [L134] var_1_6 = (var_1_8 - var_1_9) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-255, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=5368709145, var_1_8=6442450943, var_1_9=1073741798] [L136] signed long int stepLocal_6 = 0; [L137] unsigned long int stepLocal_5 = 25u; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_5=25, stepLocal_6=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-255, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=5368709145, var_1_8=6442450943, var_1_9=1073741798] [L138] COND FALSE !(stepLocal_6 >= ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_5=25, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-255, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=5368709145, var_1_8=6442450943, var_1_9=1073741798] [L143] COND FALSE !(var_1_8 < stepLocal_5) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-255, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=5368709145, var_1_8=6442450943, var_1_9=1073741798] [L147] COND TRUE var_1_33 >= 0.25 [L148] var_1_19 = (var_1_17 + var_1_20) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-255, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=5368709145, var_1_8=6442450943, var_1_9=1073741798] [L207] RET step() [L208] CALL, EXPR property() [L197] EXPR (((((((((((((last_1_var_1_12 >= last_1_var_1_24) ? (last_1_var_1_29 ? (var_1_1 == ((unsigned short int) (var_1_5 - last_1_var_1_12))) : 1) : 1) && (((var_1_33 * 8.2) < 10.4) ? (var_1_6 == ((unsigned long int) (var_1_8 - var_1_9))) : 1)) && (last_1_var_1_29 ? (last_1_var_1_29 ? (var_1_9 == ((signed long int) (last_1_var_1_24 + 100))) : (var_1_9 == ((signed long int) (((((var_1_5 + last_1_var_1_24)) > (last_1_var_1_9)) ? ((var_1_5 + last_1_var_1_24)) : (last_1_var_1_9)))))) : (var_1_9 == ((signed long int) ((var_1_11 - 16) - last_1_var_1_24))))) && (last_1_var_1_29 ? (var_1_12 == ((unsigned char) (64 + var_1_13))) : (var_1_12 == ((unsigned char) (32 + ((((var_1_14 - 2) < 0 ) ? -(var_1_14 - 2) : (var_1_14 - 2)))))))) && (var_1_15 == ((double) ((var_1_16 - var_1_17) - var_1_18)))) && ((var_1_33 >= 0.25) ? (var_1_19 == ((float) (var_1_17 + var_1_20))) : 1)) && ((var_1_26 >= (var_1_26 + (var_1_14 * 16))) ? ((-256 > var_1_24) ? (var_1_21 == ((double) var_1_17)) : 1) : (var_1_21 == ((double) (((((1.75) < (var_1_18)) ? (1.75) : (var_1_18))) - (9.9999999995E9 + var_1_17)))))) && (var_1_27 ? (var_1_23 == ((double) ((((4.5) < 0 ) ? -(4.5) : (4.5))))) : 1)) && (((var_1_13 * (var_1_5 * last_1_var_1_9)) <= var_1_14) ? (var_1_24 == ((signed long int) 50)) : ((last_1_var_1_27 || last_1_var_1_27) ? ((last_1_var_1_27 || last_1_var_1_27) ? (var_1_24 == ((signed long int) last_1_var_1_12)) : 1) : (var_1_24 == ((signed long int) var_1_13))))) && ((0 >= ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6)))) ? (var_1_27 ? (var_1_25 == ((unsigned short int) (((((var_1_5 - var_1_9)) > ((var_1_12 + var_1_24))) ? ((var_1_5 - var_1_9)) : ((var_1_12 + var_1_24)))))) : 1) : ((var_1_8 < 25u) ? (var_1_25 == ((unsigned short int) var_1_6)) : 1))) && ((last_1_var_1_24 >= (128u + last_1_var_1_1)) ? ((10000000 != var_1_14) ? (var_1_26 == ((signed short int) last_1_var_1_25)) : 1) : 1)) && ((50u >= var_1_5) ? (var_1_27 == ((unsigned char) var_1_28)) : 1)) && ((var_1_28 && var_1_27) ? (var_1_29 == ((unsigned char) (var_1_28 && var_1_30))) : ((((((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14))) > (-25 << var_1_9)) ? (var_1_29 == ((unsigned char) (var_1_27 || var_1_28))) : (var_1_29 == ((unsigned char) ((var_1_23 <= ((((var_1_21) < (var_1_17)) ? (var_1_21) : (var_1_17)))) && var_1_32))))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-255, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=5368709145, var_1_8=6442450943, var_1_9=1073741798] [L197-L198] return ((((((((((((((last_1_var_1_12 >= last_1_var_1_24) ? (last_1_var_1_29 ? (var_1_1 == ((unsigned short int) (var_1_5 - last_1_var_1_12))) : 1) : 1) && (((var_1_33 * 8.2) < 10.4) ? (var_1_6 == ((unsigned long int) (var_1_8 - var_1_9))) : 1)) && (last_1_var_1_29 ? (last_1_var_1_29 ? (var_1_9 == ((signed long int) (last_1_var_1_24 + 100))) : (var_1_9 == ((signed long int) (((((var_1_5 + last_1_var_1_24)) > (last_1_var_1_9)) ? ((var_1_5 + last_1_var_1_24)) : (last_1_var_1_9)))))) : (var_1_9 == ((signed long int) ((var_1_11 - 16) - last_1_var_1_24))))) && (last_1_var_1_29 ? (var_1_12 == ((unsigned char) (64 + var_1_13))) : (var_1_12 == ((unsigned char) (32 + ((((var_1_14 - 2) < 0 ) ? -(var_1_14 - 2) : (var_1_14 - 2)))))))) && (var_1_15 == ((double) ((var_1_16 - var_1_17) - var_1_18)))) && ((var_1_33 >= 0.25) ? (var_1_19 == ((float) (var_1_17 + var_1_20))) : 1)) && ((var_1_26 >= (var_1_26 + (var_1_14 * 16))) ? ((-256 > var_1_24) ? (var_1_21 == ((double) var_1_17)) : 1) : (var_1_21 == ((double) (((((1.75) < (var_1_18)) ? (1.75) : (var_1_18))) - (9.9999999995E9 + var_1_17)))))) && (var_1_27 ? (var_1_23 == ((double) ((((4.5) < 0 ) ? -(4.5) : (4.5))))) : 1)) && (((var_1_13 * (var_1_5 * last_1_var_1_9)) <= var_1_14) ? (var_1_24 == ((signed long int) 50)) : ((last_1_var_1_27 || last_1_var_1_27) ? ((last_1_var_1_27 || last_1_var_1_27) ? (var_1_24 == ((signed long int) last_1_var_1_12)) : 1) : (var_1_24 == ((signed long int) var_1_13))))) && ((0 >= ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6)))) ? (var_1_27 ? (var_1_25 == ((unsigned short int) (((((var_1_5 - var_1_9)) > ((var_1_12 + var_1_24))) ? ((var_1_5 - var_1_9)) : ((var_1_12 + var_1_24)))))) : 1) : ((var_1_8 < 25u) ? (var_1_25 == ((unsigned short int) var_1_6)) : 1))) && ((last_1_var_1_24 >= (128u + last_1_var_1_1)) ? ((10000000 != var_1_14) ? (var_1_26 == ((signed short int) last_1_var_1_25)) : 1) : 1)) && ((50u >= var_1_5) ? (var_1_27 == ((unsigned char) var_1_28)) : 1)) && ((var_1_28 && var_1_27) ? (var_1_29 == ((unsigned char) (var_1_28 && var_1_30))) : ((((((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14))) > (-25 << var_1_9)) ? (var_1_29 == ((unsigned char) (var_1_27 || var_1_28))) : (var_1_29 == ((unsigned char) ((var_1_23 <= ((((var_1_21) < (var_1_17)) ? (var_1_21) : (var_1_17)))) && var_1_32)))))) && ((var_1_32 || (var_1_26 > var_1_1)) ? (var_1_33 == ((float) (((((var_1_20 + ((((var_1_17) > (var_1_34)) ? (var_1_17) : (var_1_34))))) < (var_1_16)) ? ((var_1_20 + ((((var_1_17) > (var_1_34)) ? (var_1_17) : (var_1_34))))) : (var_1_16))))) : (var_1_33 == ((float) var_1_16))) ; [L208] RET, EXPR property() [L208] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-255, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=5368709145, var_1_8=6442450943, var_1_9=1073741798] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=-193, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-255, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=5368709145, var_1_8=6442450943, var_1_9=1073741798] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.5s, OverallIterations: 9, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4291 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4263 mSDsluCounter, 6238 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5065 mSDsCounter, 1107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4490 IncrementalHoareTripleChecker+Invalid, 5597 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1107 mSolverCounterUnsat, 1173 mSDtfsCounter, 4490 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1587 GetRequests, 1327 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6847 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3696occurred in iteration=7, InterpolantAutomatonStates: 212, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 1195 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2257 NumberOfCodeBlocks, 2257 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2389 ConstructedInterpolants, 0 QuantifiedInterpolants, 9682 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1950 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 12743/13440 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-02-06 00:50:12,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-66.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 c37a39e3553d97b9437718bbedaac5bd18bbf82294e1487f72d36703f09800e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:50:14,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:50:14,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 00:50:14,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:50:14,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:50:14,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:50:14,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:50:14,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:50:14,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:50:14,381 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:50:14,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:50:14,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:50:14,382 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:50:14,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:50:14,384 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:50:14,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:50:14,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:50:14,388 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:50:14,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:50:14,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:50:14,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:50:14,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:50:14,388 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:50:14,388 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 00:50:14,389 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 00:50:14,389 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 00:50:14,389 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:50:14,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:50:14,389 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:50:14,389 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:50:14,389 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:50:14,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:50:14,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:50:14,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:50:14,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:50:14,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:50:14,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:50:14,390 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:50:14,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:50:14,390 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 00:50:14,390 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 00:50:14,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:50:14,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:50:14,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:50:14,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:50:14,391 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-jdk21/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 -> c37a39e3553d97b9437718bbedaac5bd18bbf82294e1487f72d36703f09800e5 [2025-02-06 00:50:14,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:50:14,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:50:14,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:50:14,624 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:50:14,625 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:50:14,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-66.i [2025-02-06 00:50:15,805 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/512550885/4c19060b8bf6426ebcc3869abbbe30ce/FLAG9a8f144e3 [2025-02-06 00:50:16,052 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:50:16,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-66.i [2025-02-06 00:50:16,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/512550885/4c19060b8bf6426ebcc3869abbbe30ce/FLAG9a8f144e3 [2025-02-06 00:50:16,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/512550885/4c19060b8bf6426ebcc3869abbbe30ce [2025-02-06 00:50:16,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:50:16,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:50:16,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:50:16,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:50:16,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:50:16,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:50:16" (1/1) ... [2025-02-06 00:50:16,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794c8e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:16, skipping insertion in model container [2025-02-06 00:50:16,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:50:16" (1/1) ... [2025-02-06 00:50:16,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:50:16,217 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-66.i[916,929] [2025-02-06 00:50:16,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:50:16,330 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:50:16,341 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-66.i[916,929] [2025-02-06 00:50:16,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:50:16,395 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:50:16,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:16 WrapperNode [2025-02-06 00:50:16,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:50:16,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:50:16,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:50:16,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:50:16,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:16" (1/1) ... [2025-02-06 00:50:16,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:16" (1/1) ... [2025-02-06 00:50:16,437 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2025-02-06 00:50:16,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:50:16,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:50:16,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:50:16,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:50:16,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:16" (1/1) ... [2025-02-06 00:50:16,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:16" (1/1) ... [2025-02-06 00:50:16,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:16" (1/1) ... [2025-02-06 00:50:16,456 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-02-06 00:50:16,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:16" (1/1) ... [2025-02-06 00:50:16,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:16" (1/1) ... [2025-02-06 00:50:16,463 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:16" (1/1) ... [2025-02-06 00:50:16,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:16" (1/1) ... [2025-02-06 00:50:16,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:16" (1/1) ... [2025-02-06 00:50:16,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:16" (1/1) ... [2025-02-06 00:50:16,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:50:16,468 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:50:16,468 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:50:16,468 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:50:16,469 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:16" (1/1) ... [2025-02-06 00:50:16,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:50:16,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:50:16,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 00:50:16,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 00:50:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:50:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 00:50:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:50:16,527 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:50:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:50:16,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:50:16,609 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:50:16,610 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:50:32,363 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-02-06 00:50:32,363 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:50:32,371 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:50:32,371 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:50:32,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:50:32 BoogieIcfgContainer [2025-02-06 00:50:32,372 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:50:32,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:50:32,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:50:32,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:50:32,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:50:16" (1/3) ... [2025-02-06 00:50:32,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6c3997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:50:32, skipping insertion in model container [2025-02-06 00:50:32,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:16" (2/3) ... [2025-02-06 00:50:32,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6c3997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:50:32, skipping insertion in model container [2025-02-06 00:50:32,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:50:32" (3/3) ... [2025-02-06 00:50:32,380 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-66.i [2025-02-06 00:50:32,389 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:50:32,392 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-66.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:50:32,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:50:32,435 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;@7c8790e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:50:32,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:50:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 00:50:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 00:50:32,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:32,444 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:32,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:32,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:32,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1563240677, now seen corresponding path program 1 times [2025-02-06 00:50:32,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:50:32,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119631022] [2025-02-06 00:50:32,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:32,455 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-02-06 00:50:32,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:50:32,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-06 00:50:32,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 00:50:32,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 00:50:33,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 00:50:33,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:33,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:33,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:50:33,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:50:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-02-06 00:50:33,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:50:33,194 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:50:33,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119631022] [2025-02-06 00:50:33,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119631022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:50:33,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:50:33,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 00:50:33,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043016403] [2025-02-06 00:50:33,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:50:33,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:50:33,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:50:33,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:50:33,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:50:33,211 INFO L87 Difference]: Start difference. First operand has 80 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 00:50:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:33,226 INFO L93 Difference]: Finished difference Result 157 states and 266 transitions. [2025-02-06 00:50:33,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:50:33,227 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 147 [2025-02-06 00:50:33,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:33,231 INFO L225 Difference]: With dead ends: 157 [2025-02-06 00:50:33,231 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 00:50:33,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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-02-06 00:50:33,235 INFO L435 NwaCegarLoop]: 122 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, 122 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-02-06 00:50:33,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:50:33,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 00:50:33,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-06 00:50:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 00:50:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 119 transitions. [2025-02-06 00:50:33,258 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 119 transitions. Word has length 147 [2025-02-06 00:50:33,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:33,258 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 119 transitions. [2025-02-06 00:50:33,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 00:50:33,259 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 119 transitions. [2025-02-06 00:50:33,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 00:50:33,262 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:33,262 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:33,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 00:50:33,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-06 00:50:33,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:33,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:33,464 INFO L85 PathProgramCache]: Analyzing trace with hash -542928184, now seen corresponding path program 1 times [2025-02-06 00:50:33,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:50:33,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076372192] [2025-02-06 00:50:33,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:33,465 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-02-06 00:50:33,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:50:33,467 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-06 00:50:33,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 00:50:33,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 00:50:34,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 00:50:34,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:34,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:34,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 00:50:34,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:50:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 00:50:37,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:50:37,062 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:50:37,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076372192] [2025-02-06 00:50:37,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076372192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:50:37,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:50:37,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:50:37,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416233733] [2025-02-06 00:50:37,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:50:37,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:50:37,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:50:37,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:50:37,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:50:37,068 INFO L87 Difference]: Start difference. First operand 77 states and 119 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 00:50:41,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:50:45,671 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-02-06 00:50:50,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:50:54,100 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-02-06 00:50:54,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:54,101 INFO L93 Difference]: Finished difference Result 239 states and 374 transitions. [2025-02-06 00:50:54,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:50:54,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 147 [2025-02-06 00:50:54,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:54,181 INFO L225 Difference]: With dead ends: 239 [2025-02-06 00:50:54,181 INFO L226 Difference]: Without dead ends: 165 [2025-02-06 00:50:54,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:50:54,182 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 117 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 49 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:54,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 330 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 16.9s Time] [2025-02-06 00:50:54,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-06 00:50:54,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 136. [2025-02-06 00:50:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 00:50:54,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 210 transitions. [2025-02-06 00:50:54,196 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 210 transitions. Word has length 147 [2025-02-06 00:50:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:54,197 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 210 transitions. [2025-02-06 00:50:54,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 00:50:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 210 transitions. [2025-02-06 00:50:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 00:50:54,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:54,202 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:54,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 00:50:54,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-06 00:50:54,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:54,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:54,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1713982823, now seen corresponding path program 1 times [2025-02-06 00:50:54,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:50:54,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080691718] [2025-02-06 00:50:54,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:54,404 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-02-06 00:50:54,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:50:54,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-06 00:50:54,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 00:50:54,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 00:50:55,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 00:50:55,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:55,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:55,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 00:50:55,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:51:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 134 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 00:51:01,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:51:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-06 00:51:05,335 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:51:05,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080691718] [2025-02-06 00:51:05,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080691718] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:51:05,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 00:51:05,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2025-02-06 00:51:05,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869923179] [2025-02-06 00:51:05,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 00:51:05,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 00:51:05,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:51:05,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 00:51:05,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:51:05,337 INFO L87 Difference]: Start difference. First operand 136 states and 210 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-02-06 00:51:12,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:51:16,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:51:20,738 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-02-06 00:51:24,742 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 []