/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-86.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 22:50:51,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 22:50:51,143 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 22:50:51,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 22:50:51,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 22:50:51,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 22:50:51,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 22:50:51,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 22:50:51,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 22:50:51,173 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 22:50:51,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 22:50:51,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 22:50:51,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 22:50:51,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 22:50:51,174 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 22:50:51,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 22:50:51,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 22:50:51,175 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 22:50:51,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 22:50:51,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 22:50:51,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 22:50:51,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 22:50:51,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 22:50:51,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 22:50:51,182 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 22:50:51,182 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 22:50:51,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 22:50:51,182 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 22:50:51,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 22:50:51,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 22:50:51,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 22:50:51,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 22:50:51,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:50:51,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 22:50:51,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 22:50:51,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 22:50:51,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 22:50:51,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 22:50:51,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 22:50:51,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 22:50:51,185 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 22:50:51,185 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 22:50:51,185 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 22:50:51,185 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 22:50:51,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 22:50:51,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 22:50:51,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 22:50:51,406 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 22:50:51,406 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 22:50:51,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-86.i [2023-12-20 22:50:52,495 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 22:50:52,639 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 22:50:52,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-86.i [2023-12-20 22:50:52,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4877dc51e/fc50e9f0b78446e58ff7034de112078b/FLAG779a3edce [2023-12-20 22:50:52,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4877dc51e/fc50e9f0b78446e58ff7034de112078b [2023-12-20 22:50:52,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 22:50:52,660 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 22:50:52,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 22:50:52,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 22:50:52,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 22:50:52,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:50:52" (1/1) ... [2023-12-20 22:50:52,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3785f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:50:52, skipping insertion in model container [2023-12-20 22:50:52,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:50:52" (1/1) ... [2023-12-20 22:50:52,697 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 22:50:52,792 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-86.i[916,929] [2023-12-20 22:50:52,846 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:50:52,856 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 22:50:52,864 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-86.i[916,929] [2023-12-20 22:50:52,887 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:50:52,898 INFO L206 MainTranslator]: Completed translation [2023-12-20 22:50:52,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:50:52 WrapperNode [2023-12-20 22:50:52,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 22:50:52,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 22:50:52,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 22:50:52,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 22:50:52,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:50:52" (1/1) ... [2023-12-20 22:50:52,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:50:52" (1/1) ... [2023-12-20 22:50:52,966 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2023-12-20 22:50:52,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 22:50:52,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 22:50:52,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 22:50:52,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 22:50:52,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:50:52" (1/1) ... [2023-12-20 22:50:52,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:50:52" (1/1) ... [2023-12-20 22:50:52,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:50:52" (1/1) ... [2023-12-20 22:50:53,011 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]. [2023-12-20 22:50:53,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:50:52" (1/1) ... [2023-12-20 22:50:53,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:50:52" (1/1) ... [2023-12-20 22:50:53,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:50:52" (1/1) ... [2023-12-20 22:50:53,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:50:52" (1/1) ... [2023-12-20 22:50:53,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:50:52" (1/1) ... [2023-12-20 22:50:53,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:50:52" (1/1) ... [2023-12-20 22:50:53,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 22:50:53,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 22:50:53,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 22:50:53,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 22:50:53,047 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:50:52" (1/1) ... [2023-12-20 22:50:53,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:50:53,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:50:53,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 22:50:53,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 22:50:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 22:50:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 22:50:53,160 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 22:50:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 22:50:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 22:50:53,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 22:50:53,233 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 22:50:53,235 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 22:50:53,485 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 22:50:53,508 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 22:50:53,508 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 22:50:53,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:50:53 BoogieIcfgContainer [2023-12-20 22:50:53,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 22:50:53,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 22:50:53,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 22:50:53,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 22:50:53,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 10:50:52" (1/3) ... [2023-12-20 22:50:53,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf02887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:50:53, skipping insertion in model container [2023-12-20 22:50:53,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:50:52" (2/3) ... [2023-12-20 22:50:53,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf02887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:50:53, skipping insertion in model container [2023-12-20 22:50:53,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:50:53" (3/3) ... [2023-12-20 22:50:53,514 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-86.i [2023-12-20 22:50:53,526 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 22:50:53,526 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 22:50:53,558 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 22:50:53,563 INFO L357 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, mHoare=true, 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;@2fd92493, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 22:50:53,563 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 22:50:53,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 63 states have internal predecessors, (92), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-20 22:50:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-20 22:50:53,586 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:50:53,586 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:50:53,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:50:53,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:50:53,591 INFO L85 PathProgramCache]: Analyzing trace with hash -479397856, now seen corresponding path program 1 times [2023-12-20 22:50:53,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:50:53,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545579883] [2023-12-20 22:50:53,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:50:53,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:50:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:50:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:50:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:50:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:50:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:50:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:50:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:50:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:50:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:50:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:50:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:50:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:50:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:50:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:50:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:50:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:50:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 22:50:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 22:50:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 22:50:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 22:50:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-20 22:50:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-20 22:50:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-20 22:50:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 22:50:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-20 22:50:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 22:50:54,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:50:54,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545579883] [2023-12-20 22:50:54,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545579883] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:50:54,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:50:54,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 22:50:54,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150259968] [2023-12-20 22:50:54,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:50:54,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 22:50:54,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:50:54,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 22:50:54,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:50:54,196 INFO L87 Difference]: Start difference. First operand has 90 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 63 states have internal predecessors, (92), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 22:50:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:50:54,310 INFO L93 Difference]: Finished difference Result 263 states and 470 transitions. [2023-12-20 22:50:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 22:50:54,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 172 [2023-12-20 22:50:54,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:50:54,318 INFO L225 Difference]: With dead ends: 263 [2023-12-20 22:50:54,319 INFO L226 Difference]: Without dead ends: 174 [2023-12-20 22:50:54,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:50:54,323 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 126 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:50:54,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 368 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:50:54,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-20 22:50:54,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2023-12-20 22:50:54,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 118 states have (on average 1.3898305084745763) internal successors, (164), 118 states have internal predecessors, (164), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-20 22:50:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 264 transitions. [2023-12-20 22:50:54,366 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 264 transitions. Word has length 172 [2023-12-20 22:50:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:50:54,366 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 264 transitions. [2023-12-20 22:50:54,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 22:50:54,367 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 264 transitions. [2023-12-20 22:50:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-20 22:50:54,369 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:50:54,369 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:50:54,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 22:50:54,370 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:50:54,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:50:54,370 INFO L85 PathProgramCache]: Analyzing trace with hash -338849246, now seen corresponding path program 1 times [2023-12-20 22:50:54,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:50:54,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188893827] [2023-12-20 22:50:54,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:50:54,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:50:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:50:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:50:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:50:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:50:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:50:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:50:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:50:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:50:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:50:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:50:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:50:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:50:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:50:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:50:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:50:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:50:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 22:50:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 22:50:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 22:50:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 22:50:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-20 22:50:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-20 22:50:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-20 22:50:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 22:50:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-20 22:50:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 22:50:54,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:50:54,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188893827] [2023-12-20 22:50:54,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188893827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:50:54,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:50:54,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 22:50:54,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544374477] [2023-12-20 22:50:54,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:50:54,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 22:50:54,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:50:54,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 22:50:54,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 22:50:54,694 INFO L87 Difference]: Start difference. First operand 171 states and 264 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 22:50:54,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:50:54,763 INFO L93 Difference]: Finished difference Result 365 states and 561 transitions. [2023-12-20 22:50:54,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 22:50:54,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 172 [2023-12-20 22:50:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:50:54,766 INFO L225 Difference]: With dead ends: 365 [2023-12-20 22:50:54,766 INFO L226 Difference]: Without dead ends: 195 [2023-12-20 22:50:54,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 22:50:54,768 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 21 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:50:54,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 394 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:50:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-20 22:50:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 175. [2023-12-20 22:50:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 122 states have (on average 1.3770491803278688) internal successors, (168), 122 states have internal predecessors, (168), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-20 22:50:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 268 transitions. [2023-12-20 22:50:54,796 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 268 transitions. Word has length 172 [2023-12-20 22:50:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:50:54,797 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 268 transitions. [2023-12-20 22:50:54,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 22:50:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 268 transitions. [2023-12-20 22:50:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-20 22:50:54,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:50:54,804 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:50:54,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 22:50:54,804 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:50:54,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:50:54,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1148195872, now seen corresponding path program 1 times [2023-12-20 22:50:54,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:50:54,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927513674] [2023-12-20 22:50:54,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:50:54,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:50:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:50:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:50:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:50:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:50:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:50:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:50:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:50:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:50:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:50:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:50:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:50:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:50:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:50:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:50:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:50:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:50:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 22:50:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 22:50:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 22:50:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 22:50:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-20 22:50:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-20 22:50:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-20 22:50:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 22:50:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-20 22:50:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 22:50:54,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:50:54,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927513674] [2023-12-20 22:50:54,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927513674] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:50:54,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:50:54,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 22:50:54,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368326836] [2023-12-20 22:50:54,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:50:54,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 22:50:54,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:50:54,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 22:50:54,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 22:50:54,993 INFO L87 Difference]: Start difference. First operand 175 states and 268 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 22:50:55,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:50:55,037 INFO L93 Difference]: Finished difference Result 365 states and 557 transitions. [2023-12-20 22:50:55,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 22:50:55,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 172 [2023-12-20 22:50:55,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:50:55,042 INFO L225 Difference]: With dead ends: 365 [2023-12-20 22:50:55,042 INFO L226 Difference]: Without dead ends: 191 [2023-12-20 22:50:55,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 22:50:55,047 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 12 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:50:55,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 391 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:50:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-20 22:50:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 179. [2023-12-20 22:50:55,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 126 states have (on average 1.3650793650793651) internal successors, (172), 126 states have internal predecessors, (172), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-20 22:50:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 272 transitions. [2023-12-20 22:50:55,063 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 272 transitions. Word has length 172 [2023-12-20 22:50:55,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:50:55,063 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 272 transitions. [2023-12-20 22:50:55,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 22:50:55,063 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 272 transitions. [2023-12-20 22:50:55,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-20 22:50:55,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:50:55,065 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:50:55,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 22:50:55,065 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:50:55,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:50:55,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1090937570, now seen corresponding path program 1 times [2023-12-20 22:50:55,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:50:55,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377357741] [2023-12-20 22:50:55,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:50:55,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:50:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:50:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:50:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:50:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:50:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:50:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:50:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:50:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:50:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:50:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:50:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:50:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:50:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:50:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:50:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:50:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:50:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 22:50:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 22:50:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 22:50:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 22:50:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-20 22:50:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-20 22:50:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-20 22:50:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 22:50:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-20 22:50:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-20 22:50:55,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:50:55,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377357741] [2023-12-20 22:50:55,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377357741] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:50:55,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:50:55,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 22:50:55,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408670907] [2023-12-20 22:50:55,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:50:55,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 22:50:55,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:50:55,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 22:50:55,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 22:50:55,212 INFO L87 Difference]: Start difference. First operand 179 states and 272 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 22:50:55,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:50:55,245 INFO L93 Difference]: Finished difference Result 365 states and 553 transitions. [2023-12-20 22:50:55,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 22:50:55,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 172 [2023-12-20 22:50:55,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:50:55,247 INFO L225 Difference]: With dead ends: 365 [2023-12-20 22:50:55,247 INFO L226 Difference]: Without dead ends: 187 [2023-12-20 22:50:55,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 22:50:55,252 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 3 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:50:55,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 391 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:50:55,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-20 22:50:55,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2023-12-20 22:50:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 130 states have (on average 1.353846153846154) internal successors, (176), 130 states have internal predecessors, (176), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-20 22:50:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 276 transitions. [2023-12-20 22:50:55,272 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 276 transitions. Word has length 172 [2023-12-20 22:50:55,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:50:55,273 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 276 transitions. [2023-12-20 22:50:55,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-20 22:50:55,273 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 276 transitions. [2023-12-20 22:50:55,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-20 22:50:55,275 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:50:55,275 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:50:55,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 22:50:55,275 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:50:55,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:50:55,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1090877988, now seen corresponding path program 1 times [2023-12-20 22:50:55,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:50:55,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627045133] [2023-12-20 22:50:55,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:50:55,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:50:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:50:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:50:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:50:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:50:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:50:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:50:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:50:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:50:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:50:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:50:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:50:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:50:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:50:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:50:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:50:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:55,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:50:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:56,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 22:50:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:56,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 22:50:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:56,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 22:50:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:56,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 22:50:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:56,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-20 22:50:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:56,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-20 22:50:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:56,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-20 22:50:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:56,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 22:50:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:56,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-20 22:50:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 45 proven. 27 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-12-20 22:50:56,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:50:56,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627045133] [2023-12-20 22:50:56,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627045133] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 22:50:56,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978489431] [2023-12-20 22:50:56,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:50:56,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:50:56,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:50:56,075 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 22:50:56,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 22:50:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:50:56,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-20 22:50:56,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 22:50:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 594 proven. 27 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2023-12-20 22:50:56,979 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 22:50:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 45 proven. 27 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-12-20 22:50:57,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978489431] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 22:50:57,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 22:50:57,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 10] total 21 [2023-12-20 22:50:57,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885839190] [2023-12-20 22:50:57,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 22:50:57,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-20 22:50:57,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:50:57,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-20 22:50:57,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2023-12-20 22:50:57,997 INFO L87 Difference]: Start difference. First operand 183 states and 276 transitions. Second operand has 21 states, 21 states have (on average 6.523809523809524) internal successors, (137), 21 states have internal predecessors, (137), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2023-12-20 22:50:59,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:50:59,600 INFO L93 Difference]: Finished difference Result 856 states and 1257 transitions. [2023-12-20 22:50:59,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-20 22:50:59,601 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.523809523809524) internal successors, (137), 21 states have internal predecessors, (137), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) Word has length 172 [2023-12-20 22:50:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:50:59,603 INFO L225 Difference]: With dead ends: 856 [2023-12-20 22:50:59,603 INFO L226 Difference]: Without dead ends: 674 [2023-12-20 22:50:59,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=479, Invalid=1777, Unknown=0, NotChecked=0, Total=2256 [2023-12-20 22:50:59,605 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 895 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:50:59,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1724 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-20 22:50:59,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2023-12-20 22:50:59,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 380. [2023-12-20 22:50:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 273 states have (on average 1.3516483516483517) internal successors, (369), 274 states have internal predecessors, (369), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2023-12-20 22:50:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 569 transitions. [2023-12-20 22:50:59,630 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 569 transitions. Word has length 172 [2023-12-20 22:50:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:50:59,631 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 569 transitions. [2023-12-20 22:50:59,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.523809523809524) internal successors, (137), 21 states have internal predecessors, (137), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2023-12-20 22:50:59,631 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 569 transitions. [2023-12-20 22:50:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-20 22:50:59,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:50:59,632 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:50:59,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 22:50:59,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:50:59,848 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:50:59,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:50:59,848 INFO L85 PathProgramCache]: Analyzing trace with hash 54177764, now seen corresponding path program 1 times [2023-12-20 22:50:59,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:50:59,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622578716] [2023-12-20 22:50:59,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:50:59,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:50:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:51:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:51:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:51:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:51:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:51:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:51:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:51:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:51:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:51:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:51:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:51:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:51:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:51:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:51:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:51:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:51:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 22:51:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 22:51:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 22:51:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 22:51:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-20 22:51:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-20 22:51:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-20 22:51:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 22:51:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-20 22:51:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:00,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 45 proven. 93 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2023-12-20 22:51:00,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:51:00,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622578716] [2023-12-20 22:51:00,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622578716] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 22:51:00,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598120502] [2023-12-20 22:51:00,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:51:00,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:51:00,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:51:00,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 22:51:00,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 22:51:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:51:01,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-20 22:51:01,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 22:51:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 360 proven. 30 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2023-12-20 22:51:12,746 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 22:51:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 132 proven. 9 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2023-12-20 22:51:49,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598120502] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 22:51:49,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 22:51:49,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 39 [2023-12-20 22:51:49,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493374401] [2023-12-20 22:51:49,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 22:51:49,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-20 22:51:49,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:51:49,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-20 22:51:49,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2023-12-20 22:51:49,685 INFO L87 Difference]: Start difference. First operand 380 states and 569 transitions. Second operand has 39 states, 38 states have (on average 4.2894736842105265) internal successors, (163), 39 states have internal predecessors, (163), 8 states have call successors, (75), 3 states have call predecessors, (75), 8 states have return successors, (75), 9 states have call predecessors, (75), 8 states have call successors, (75) [2023-12-20 22:52:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:52:31,380 INFO L93 Difference]: Finished difference Result 2936 states and 4100 transitions. [2023-12-20 22:52:31,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 280 states. [2023-12-20 22:52:31,381 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 4.2894736842105265) internal successors, (163), 39 states have internal predecessors, (163), 8 states have call successors, (75), 3 states have call predecessors, (75), 8 states have return successors, (75), 9 states have call predecessors, (75), 8 states have call successors, (75) Word has length 172 [2023-12-20 22:52:31,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:52:31,410 INFO L225 Difference]: With dead ends: 2936 [2023-12-20 22:52:31,410 INFO L226 Difference]: Without dead ends: 2626 [2023-12-20 22:52:31,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40352 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=10255, Invalid=83075, Unknown=0, NotChecked=0, Total=93330 [2023-12-20 22:52:31,429 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 8576 mSDsluCounter, 2064 mSDsCounter, 0 mSdLazyCounter, 3348 mSolverCounterSat, 1874 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8603 SdHoareTripleChecker+Valid, 2185 SdHoareTripleChecker+Invalid, 5222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1874 IncrementalHoareTripleChecker+Valid, 3348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-20 22:52:31,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8603 Valid, 2185 Invalid, 5222 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1874 Valid, 3348 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-20 22:52:31,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states. [2023-12-20 22:52:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 1310. [2023-12-20 22:52:31,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1002 states have (on average 1.3153692614770458) internal successors, (1318), 1006 states have internal predecessors, (1318), 259 states have call successors, (259), 48 states have call predecessors, (259), 48 states have return successors, (259), 255 states have call predecessors, (259), 259 states have call successors, (259) [2023-12-20 22:52:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1836 transitions. [2023-12-20 22:52:31,535 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1836 transitions. Word has length 172 [2023-12-20 22:52:31,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:52:31,535 INFO L495 AbstractCegarLoop]: Abstraction has 1310 states and 1836 transitions. [2023-12-20 22:52:31,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.2894736842105265) internal successors, (163), 39 states have internal predecessors, (163), 8 states have call successors, (75), 3 states have call predecessors, (75), 8 states have return successors, (75), 9 states have call predecessors, (75), 8 states have call successors, (75) [2023-12-20 22:52:31,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1836 transitions. [2023-12-20 22:52:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-20 22:52:31,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:52:31,537 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:52:31,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-20 22:52:31,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-20 22:52:31,745 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:52:31,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:52:31,746 INFO L85 PathProgramCache]: Analyzing trace with hash 58748336, now seen corresponding path program 1 times [2023-12-20 22:52:31,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:52:31,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223380433] [2023-12-20 22:52:31,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:52:31,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:52:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 22:52:31,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 22:52:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 22:52:32,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 22:52:32,027 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 22:52:32,028 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 22:52:32,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 22:52:32,031 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:52:32,034 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 22:52:32,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 10:52:32 BoogieIcfgContainer [2023-12-20 22:52:32,122 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 22:52:32,122 INFO L158 Benchmark]: Toolchain (without parser) took 99462.57ms. Allocated memory was 173.0MB in the beginning and 992.0MB in the end (delta: 818.9MB). Free memory was 137.8MB in the beginning and 657.8MB in the end (delta: -520.0MB). Peak memory consumption was 299.4MB. Max. memory is 8.0GB. [2023-12-20 22:52:32,122 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 173.0MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 22:52:32,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.73ms. Allocated memory is still 173.0MB. Free memory was 137.4MB in the beginning and 121.6MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-20 22:52:32,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.31ms. Allocated memory is still 173.0MB. Free memory was 121.6MB in the beginning and 118.4MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 22:52:32,123 INFO L158 Benchmark]: Boogie Preprocessor took 78.17ms. Allocated memory is still 173.0MB. Free memory was 118.4MB in the beginning and 113.7MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-20 22:52:32,123 INFO L158 Benchmark]: RCFGBuilder took 462.74ms. Allocated memory is still 173.0MB. Free memory was 113.7MB in the beginning and 87.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-20 22:52:32,124 INFO L158 Benchmark]: TraceAbstraction took 98611.60ms. Allocated memory was 173.0MB in the beginning and 992.0MB in the end (delta: 818.9MB). Free memory was 86.9MB in the beginning and 657.8MB in the end (delta: -570.9MB). Peak memory consumption was 249.1MB. Max. memory is 8.0GB. [2023-12-20 22:52:32,125 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.11ms. Allocated memory is still 173.0MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.73ms. Allocated memory is still 173.0MB. Free memory was 137.4MB in the beginning and 121.6MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.31ms. Allocated memory is still 173.0MB. Free memory was 121.6MB in the beginning and 118.4MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 78.17ms. Allocated memory is still 173.0MB. Free memory was 118.4MB in the beginning and 113.7MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 462.74ms. Allocated memory is still 173.0MB. Free memory was 113.7MB in the beginning and 87.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 98611.60ms. Allocated memory was 173.0MB in the beginning and 992.0MB in the end (delta: 818.9MB). Free memory was 86.9MB in the beginning and 657.8MB in the end (delta: -570.9MB). Peak memory consumption was 249.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someUnaryDOUBLEoperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of bitwise operation at line 188, overapproximation of someBinaryArithmeticFLOAToperation at line 74. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 0; [L23] signed char var_1_6 = 32; [L24] signed char var_1_7 = 32; [L25] signed char var_1_8 = 1; [L26] signed char var_1_9 = 32; [L27] signed char var_1_10 = 5; [L28] signed char var_1_11 = 2; [L29] signed char var_1_12 = -100; [L30] unsigned char var_1_13 = 0; [L31] unsigned char var_1_14 = 0; [L32] signed short int var_1_15 = 256; [L33] float var_1_16 = 15.918; [L34] float var_1_17 = 0.6; [L35] float var_1_18 = 100000000.75; [L36] float var_1_19 = 16.5; [L37] float var_1_20 = 8.75; [L38] unsigned short int var_1_22 = 10; [L39] float var_1_23 = -0.6; [L40] float var_1_24 = 25.75; [L41] float var_1_25 = 127.75; [L42] signed short int var_1_26 = -5; [L43] unsigned char var_1_27 = 1; [L44] unsigned char var_1_28 = 1; [L45] unsigned char var_1_29 = 1; [L46] signed short int var_1_30 = -8; [L47] signed long int var_1_31 = -8; [L48] unsigned char var_1_32 = 0; [L49] float last_1_var_1_16 = 15.918; [L50] unsigned char last_1_var_1_27 = 1; [L51] signed short int last_1_var_1_30 = -8; [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L183] last_1_var_1_16 = var_1_16 [L184] last_1_var_1_27 = var_1_27 [L185] last_1_var_1_30 = var_1_30 [L195] RET updateLastVariables() [L196] CALL updateVariables() [L141] var_1_6 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=32, var_1_8=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=32, var_1_8=1, var_1_9=32] [L142] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=32, var_1_8=1, var_1_9=32] [L143] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=32, var_1_8=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=32, var_1_8=1, var_1_9=32] [L143] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=32, var_1_8=1, var_1_9=32] [L144] var_1_7 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=32] [L145] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=32] [L146] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=32] [L146] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=32] [L147] var_1_8 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_8 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=32] [L148] RET assume_abort_if_not(var_1_8 >= -63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=32] [L149] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=32] [L149] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=32] [L150] var_1_9 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L151] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L152] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L153] var_1_10 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L154] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L155] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L155] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L156] var_1_11 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L157] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L158] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L159] var_1_12 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L160] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L161] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L161] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L162] var_1_14 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L163] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L164] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L164] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L165] var_1_17 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L166] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L167] var_1_18 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L168] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L169] var_1_19 = __VERIFIER_nondet_float() [L170] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L170] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L171] var_1_24 = __VERIFIER_nondet_float() [L172] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L172] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L173] var_1_25 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_25 >= 0.0F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L174] RET assume_abort_if_not((var_1_25 >= 0.0F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [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_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L176] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L177] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L178] var_1_29 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L179] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L180] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L180] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L196] RET updateVariables() [L197] CALL step() [L55] EXPR var_1_7 << var_1_6 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L55] COND FALSE !(10u <= (var_1_7 << var_1_6)) [L62] EXPR -100000 >> var_1_8 [L62] signed long int stepLocal_0 = -100000 >> var_1_8; [L63] COND TRUE stepLocal_0 < var_1_9 [L64] var_1_15 = ((4 - var_1_11) + (-1 + last_1_var_1_30)) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_0=-1, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L72] EXPR var_1_6 >> var_1_15 [L72] signed long int stepLocal_2 = var_1_6 >> var_1_15; [L73] COND TRUE stepLocal_2 >= var_1_8 [L74] var_1_23 = (var_1_24 - var_1_25) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_0=-1, stepLocal_2=1, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L76] COND FALSE !(\read(var_1_13)) [L79] var_1_22 = ((var_1_7 + 8) + var_1_9) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_0=-1, stepLocal_2=1, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=12, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L81] var_1_31 = var_1_8 [L82] var_1_32 = 0 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_0=-1, stepLocal_2=1, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=12, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L83] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_0=-1, stepLocal_2=1, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=12, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L88] signed char stepLocal_3 = var_1_11; [L89] EXPR var_1_10 >> var_1_12 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_0=-1, stepLocal_2=1, stepLocal_3=5, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=12, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L89] COND TRUE stepLocal_3 < (var_1_10 >> var_1_12) [L90] var_1_26 = (var_1_9 + var_1_7) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_0=-1, stepLocal_2=1, stepLocal_3=5, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=12, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L98] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_0=-1, stepLocal_1=0, stepLocal_2=1, stepLocal_3=5, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=12, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L99] COND FALSE !(((8 * var_1_15) > var_1_6) || stepLocal_1) [L104] var_1_16 = var_1_19 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_0=-1, stepLocal_1=0, stepLocal_2=1, stepLocal_3=5, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=100000005, var_1_19=100000005, var_1_1=0, var_1_20=35/4, var_1_22=12, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L106] signed char stepLocal_5 = var_1_9; VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_0=-1, stepLocal_1=0, stepLocal_2=1, stepLocal_3=5, stepLocal_5=0, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=100000005, var_1_19=100000005, var_1_1=0, var_1_20=35/4, var_1_22=12, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L107] COND FALSE !(stepLocal_5 < var_1_15) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_0=-1, stepLocal_1=0, stepLocal_2=1, stepLocal_3=5, stepLocal_5=0, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=100000005, var_1_19=100000005, var_1_1=0, var_1_20=35/4, var_1_22=12, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L110] COND FALSE !((var_1_16 / 1.5) < 8.725) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_0=-1, stepLocal_1=0, stepLocal_2=1, stepLocal_3=5, stepLocal_5=0, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=100000005, var_1_19=100000005, var_1_1=0, var_1_20=35/4, var_1_22=12, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L116] COND FALSE !(! (var_1_32 || (var_1_16 > var_1_23))) [L127] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_0=-1, stepLocal_1=0, stepLocal_2=1, stepLocal_3=5, stepLocal_5=0, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=100000005, var_1_19=100000005, var_1_1=4, var_1_20=35/4, var_1_22=12, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L129] EXPR var_1_26 & var_1_11 [L129] signed long int stepLocal_4 = var_1_26 & var_1_11; [L130] COND TRUE var_1_10 > stepLocal_4 [L131] var_1_27 = (var_1_28 && (! (! var_1_29))) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_0=-1, stepLocal_1=0, stepLocal_2=1, stepLocal_3=5, stepLocal_4=3, stepLocal_5=0, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=100000005, var_1_19=100000005, var_1_1=4, var_1_20=35/4, var_1_22=12, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L197] RET step() [L198] CALL, EXPR property() [L188] EXPR ((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1) [L188] EXPR var_1_7 << var_1_6 [L188] EXPR ((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=100000005, var_1_19=100000005, var_1_1=4, var_1_20=35/4, var_1_22=12, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L188] EXPR (((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10)))) [L188] EXPR -100000 >> var_1_8 [L188] EXPR (((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10)))) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=100000005, var_1_19=100000005, var_1_1=4, var_1_20=35/4, var_1_22=12, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L188] EXPR (((((((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10))))) && ((((8 * var_1_15) > var_1_6) || var_1_13) ? ((last_1_var_1_16 < var_1_20) ? (var_1_16 == ((float) ((((((var_1_17 + var_1_18) + 4.5f)) < (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19))))) ? (((var_1_17 + var_1_18) + 4.5f)) : (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19)))))))) : 1) : (var_1_16 == ((float) var_1_19)))) && (var_1_13 ? (var_1_32 ? (var_1_20 == ((float) (((((var_1_17 + var_1_18)) > (var_1_19)) ? ((var_1_17 + var_1_18)) : (var_1_19))))) : 1) : 1)) && (var_1_13 ? (var_1_22 == ((unsigned short int) ((((var_1_10) > (var_1_9)) ? (var_1_10) : (var_1_9))))) : (var_1_22 == ((unsigned short int) ((var_1_7 + 8) + var_1_9))))) && (((var_1_6 >> var_1_15) >= var_1_8) ? (var_1_23 == ((float) (var_1_24 - var_1_25))) : 1) [L188] EXPR var_1_6 >> var_1_15 [L188] EXPR (((((((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10))))) && ((((8 * var_1_15) > var_1_6) || var_1_13) ? ((last_1_var_1_16 < var_1_20) ? (var_1_16 == ((float) ((((((var_1_17 + var_1_18) + 4.5f)) < (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19))))) ? (((var_1_17 + var_1_18) + 4.5f)) : (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19)))))))) : 1) : (var_1_16 == ((float) var_1_19)))) && (var_1_13 ? (var_1_32 ? (var_1_20 == ((float) (((((var_1_17 + var_1_18)) > (var_1_19)) ? ((var_1_17 + var_1_18)) : (var_1_19))))) : 1) : 1)) && (var_1_13 ? (var_1_22 == ((unsigned short int) ((((var_1_10) > (var_1_9)) ? (var_1_10) : (var_1_9))))) : (var_1_22 == ((unsigned short int) ((var_1_7 + 8) + var_1_9))))) && (((var_1_6 >> var_1_15) >= var_1_8) ? (var_1_23 == ((float) (var_1_24 - var_1_25))) : 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=100000005, var_1_19=100000005, var_1_1=4, var_1_20=35/4, var_1_22=12, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L188] EXPR ((((((((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10))))) && ((((8 * var_1_15) > var_1_6) || var_1_13) ? ((last_1_var_1_16 < var_1_20) ? (var_1_16 == ((float) ((((((var_1_17 + var_1_18) + 4.5f)) < (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19))))) ? (((var_1_17 + var_1_18) + 4.5f)) : (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19)))))))) : 1) : (var_1_16 == ((float) var_1_19)))) && (var_1_13 ? (var_1_32 ? (var_1_20 == ((float) (((((var_1_17 + var_1_18)) > (var_1_19)) ? ((var_1_17 + var_1_18)) : (var_1_19))))) : 1) : 1)) && (var_1_13 ? (var_1_22 == ((unsigned short int) ((((var_1_10) > (var_1_9)) ? (var_1_10) : (var_1_9))))) : (var_1_22 == ((unsigned short int) ((var_1_7 + 8) + var_1_9))))) && (((var_1_6 >> var_1_15) >= var_1_8) ? (var_1_23 == ((float) (var_1_24 - var_1_25))) : 1)) && ((var_1_11 < (var_1_10 >> var_1_12)) ? (var_1_26 == ((signed short int) (var_1_9 + var_1_7))) : ((var_1_20 != var_1_23) ? (var_1_26 == ((signed short int) ((((var_1_10) < (var_1_7)) ? (var_1_10) : (var_1_7))))) : (var_1_26 == ((signed short int) var_1_9)))) [L188] EXPR var_1_10 >> var_1_12 [L188] EXPR ((((((((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10))))) && ((((8 * var_1_15) > var_1_6) || var_1_13) ? ((last_1_var_1_16 < var_1_20) ? (var_1_16 == ((float) ((((((var_1_17 + var_1_18) + 4.5f)) < (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19))))) ? (((var_1_17 + var_1_18) + 4.5f)) : (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19)))))))) : 1) : (var_1_16 == ((float) var_1_19)))) && (var_1_13 ? (var_1_32 ? (var_1_20 == ((float) (((((var_1_17 + var_1_18)) > (var_1_19)) ? ((var_1_17 + var_1_18)) : (var_1_19))))) : 1) : 1)) && (var_1_13 ? (var_1_22 == ((unsigned short int) ((((var_1_10) > (var_1_9)) ? (var_1_10) : (var_1_9))))) : (var_1_22 == ((unsigned short int) ((var_1_7 + 8) + var_1_9))))) && (((var_1_6 >> var_1_15) >= var_1_8) ? (var_1_23 == ((float) (var_1_24 - var_1_25))) : 1)) && ((var_1_11 < (var_1_10 >> var_1_12)) ? (var_1_26 == ((signed short int) (var_1_9 + var_1_7))) : ((var_1_20 != var_1_23) ? (var_1_26 == ((signed short int) ((((var_1_10) < (var_1_7)) ? (var_1_10) : (var_1_7))))) : (var_1_26 == ((signed short int) var_1_9)))) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=100000005, var_1_19=100000005, var_1_1=4, var_1_20=35/4, var_1_22=12, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L188] EXPR (((((((((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10))))) && ((((8 * var_1_15) > var_1_6) || var_1_13) ? ((last_1_var_1_16 < var_1_20) ? (var_1_16 == ((float) ((((((var_1_17 + var_1_18) + 4.5f)) < (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19))))) ? (((var_1_17 + var_1_18) + 4.5f)) : (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19)))))))) : 1) : (var_1_16 == ((float) var_1_19)))) && (var_1_13 ? (var_1_32 ? (var_1_20 == ((float) (((((var_1_17 + var_1_18)) > (var_1_19)) ? ((var_1_17 + var_1_18)) : (var_1_19))))) : 1) : 1)) && (var_1_13 ? (var_1_22 == ((unsigned short int) ((((var_1_10) > (var_1_9)) ? (var_1_10) : (var_1_9))))) : (var_1_22 == ((unsigned short int) ((var_1_7 + 8) + var_1_9))))) && (((var_1_6 >> var_1_15) >= var_1_8) ? (var_1_23 == ((float) (var_1_24 - var_1_25))) : 1)) && ((var_1_11 < (var_1_10 >> var_1_12)) ? (var_1_26 == ((signed short int) (var_1_9 + var_1_7))) : ((var_1_20 != var_1_23) ? (var_1_26 == ((signed short int) ((((var_1_10) < (var_1_7)) ? (var_1_10) : (var_1_7))))) : (var_1_26 == ((signed short int) var_1_9))))) && ((var_1_10 > (var_1_26 & var_1_11)) ? (var_1_27 == ((unsigned char) (var_1_28 && (! (! var_1_29))))) : ((! var_1_13) ? (var_1_27 == ((unsigned char) var_1_29)) : (var_1_27 == ((unsigned char) var_1_14)))) [L188] EXPR var_1_26 & var_1_11 [L188] EXPR (((((((((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10))))) && ((((8 * var_1_15) > var_1_6) || var_1_13) ? ((last_1_var_1_16 < var_1_20) ? (var_1_16 == ((float) ((((((var_1_17 + var_1_18) + 4.5f)) < (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19))))) ? (((var_1_17 + var_1_18) + 4.5f)) : (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19)))))))) : 1) : (var_1_16 == ((float) var_1_19)))) && (var_1_13 ? (var_1_32 ? (var_1_20 == ((float) (((((var_1_17 + var_1_18)) > (var_1_19)) ? ((var_1_17 + var_1_18)) : (var_1_19))))) : 1) : 1)) && (var_1_13 ? (var_1_22 == ((unsigned short int) ((((var_1_10) > (var_1_9)) ? (var_1_10) : (var_1_9))))) : (var_1_22 == ((unsigned short int) ((var_1_7 + 8) + var_1_9))))) && (((var_1_6 >> var_1_15) >= var_1_8) ? (var_1_23 == ((float) (var_1_24 - var_1_25))) : 1)) && ((var_1_11 < (var_1_10 >> var_1_12)) ? (var_1_26 == ((signed short int) (var_1_9 + var_1_7))) : ((var_1_20 != var_1_23) ? (var_1_26 == ((signed short int) ((((var_1_10) < (var_1_7)) ? (var_1_10) : (var_1_7))))) : (var_1_26 == ((signed short int) var_1_9))))) && ((var_1_10 > (var_1_26 & var_1_11)) ? (var_1_27 == ((unsigned char) (var_1_28 && (! (! var_1_29))))) : ((! var_1_13) ? (var_1_27 == ((unsigned char) var_1_29)) : (var_1_27 == ((unsigned char) var_1_14)))) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=100000005, var_1_19=100000005, var_1_1=4, var_1_20=35/4, var_1_22=12, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L188-L189] return ((((((((((((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10))))) && ((((8 * var_1_15) > var_1_6) || var_1_13) ? ((last_1_var_1_16 < var_1_20) ? (var_1_16 == ((float) ((((((var_1_17 + var_1_18) + 4.5f)) < (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19))))) ? (((var_1_17 + var_1_18) + 4.5f)) : (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19)))))))) : 1) : (var_1_16 == ((float) var_1_19)))) && (var_1_13 ? (var_1_32 ? (var_1_20 == ((float) (((((var_1_17 + var_1_18)) > (var_1_19)) ? ((var_1_17 + var_1_18)) : (var_1_19))))) : 1) : 1)) && (var_1_13 ? (var_1_22 == ((unsigned short int) ((((var_1_10) > (var_1_9)) ? (var_1_10) : (var_1_9))))) : (var_1_22 == ((unsigned short int) ((var_1_7 + 8) + var_1_9))))) && (((var_1_6 >> var_1_15) >= var_1_8) ? (var_1_23 == ((float) (var_1_24 - var_1_25))) : 1)) && ((var_1_11 < (var_1_10 >> var_1_12)) ? (var_1_26 == ((signed short int) (var_1_9 + var_1_7))) : ((var_1_20 != var_1_23) ? (var_1_26 == ((signed short int) ((((var_1_10) < (var_1_7)) ? (var_1_10) : (var_1_7))))) : (var_1_26 == ((signed short int) var_1_9))))) && ((var_1_10 > (var_1_26 & var_1_11)) ? (var_1_27 == ((unsigned char) (var_1_28 && (! (! var_1_29))))) : ((! var_1_13) ? (var_1_27 == ((unsigned char) var_1_29)) : (var_1_27 == ((unsigned char) var_1_14))))) && ((var_1_9 < var_1_15) ? (var_1_30 == ((signed short int) (var_1_10 - ((((var_1_9) > (var_1_11)) ? (var_1_9) : (var_1_11)))))) : (((var_1_16 / 1.5) < 8.725) ? ((var_1_20 != (((((- var_1_20)) < (var_1_16)) ? ((- var_1_20)) : (var_1_16)))) ? (var_1_30 == ((signed short int) (var_1_8 + 128))) : 1) : 1))) && (var_1_31 == ((signed long int) var_1_8))) && (var_1_32 == ((unsigned char) 0)) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=100000005, var_1_19=100000005, var_1_1=4, var_1_20=35/4, var_1_22=12, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=4, var_1_11=5, var_1_12=126, var_1_13=0, var_1_14=0, var_1_15=-10, var_1_16=100000005, var_1_19=100000005, var_1_1=4, var_1_20=35/4, var_1_22=12, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=1, var_1_32=0, var_1_6=6, var_1_7=4, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 98.5s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 43.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9683 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9633 mSDsluCounter, 5453 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4569 mSDsCounter, 2360 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4818 IncrementalHoareTripleChecker+Invalid, 7178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2360 mSolverCounterUnsat, 884 mSDtfsCounter, 4818 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1338 GetRequests, 978 SyntacticMatches, 0 SemanticMatches, 360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40940 ImplicationChecksByTransitivity, 40.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1310occurred in iteration=6, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 1649 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 52.9s InterpolantComputationTime, 1549 NumberOfCodeBlocks, 1549 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1710 ConstructedInterpolants, 0 QuantifiedInterpolants, 28857 SizeOfPredicates, 37 NumberOfNonLiveVariables, 840 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 11787/12000 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-20 22:52:32,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...