/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 09:36:49,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 09:36:50,013 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-19 09:36:50,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 09:36:50,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 09:36:50,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 09:36:50,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 09:36:50,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 09:36:50,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 09:36:50,045 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 09:36:50,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 09:36:50,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 09:36:50,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 09:36:50,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 09:36:50,046 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 09:36:50,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 09:36:50,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 09:36:50,047 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 09:36:50,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 09:36:50,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 09:36:50,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 09:36:50,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 09:36:50,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 09:36:50,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 09:36:50,048 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 09:36:50,048 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 09:36:50,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 09:36:50,049 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 09:36:50,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 09:36:50,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 09:36:50,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 09:36:50,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 09:36:50,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 09:36:50,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 09:36:50,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 09:36:50,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 09:36:50,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 09:36:50,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 09:36:50,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 09:36:50,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 09:36:50,051 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 09:36:50,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 09:36:50,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 09:36:50,052 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 -> true [2023-12-19 09:36:50,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 09:36:50,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 09:36:50,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 09:36:50,272 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 09:36:50,272 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 09:36:50,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i [2023-12-19 09:36:51,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 09:36:51,647 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 09:36:51,648 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i [2023-12-19 09:36:51,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3d3ef8b2/29253768f62b4172abcff7b0b787a8cd/FLAG5bf29a397 [2023-12-19 09:36:51,673 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3d3ef8b2/29253768f62b4172abcff7b0b787a8cd [2023-12-19 09:36:51,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 09:36:51,676 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 09:36:51,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 09:36:51,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 09:36:51,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 09:36:51,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 09:36:51" (1/1) ... [2023-12-19 09:36:51,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6062a9ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:36:51, skipping insertion in model container [2023-12-19 09:36:51,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 09:36:51" (1/1) ... [2023-12-19 09:36:51,717 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 09:36:51,826 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_fillercode_fillercodestructure_filler-ps-ci_file-30.i[919,932] [2023-12-19 09:36:51,876 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 09:36:51,885 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 09:36:51,893 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_fillercode_fillercodestructure_filler-ps-ci_file-30.i[919,932] [2023-12-19 09:36:51,923 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 09:36:51,935 INFO L206 MainTranslator]: Completed translation [2023-12-19 09:36:51,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:36:51 WrapperNode [2023-12-19 09:36:51,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 09:36:51,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 09:36:51,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 09:36:51,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 09:36:51,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:36:51" (1/1) ... [2023-12-19 09:36:51,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:36:51" (1/1) ... [2023-12-19 09:36:52,001 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2023-12-19 09:36:52,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 09:36:52,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 09:36:52,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 09:36:52,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 09:36:52,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:36:51" (1/1) ... [2023-12-19 09:36:52,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:36:51" (1/1) ... [2023-12-19 09:36:52,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:36:51" (1/1) ... [2023-12-19 09:36:52,034 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-19 09:36:52,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:36:51" (1/1) ... [2023-12-19 09:36:52,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:36:51" (1/1) ... [2023-12-19 09:36:52,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:36:51" (1/1) ... [2023-12-19 09:36:52,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:36:51" (1/1) ... [2023-12-19 09:36:52,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:36:51" (1/1) ... [2023-12-19 09:36:52,049 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:36:51" (1/1) ... [2023-12-19 09:36:52,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 09:36:52,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 09:36:52,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 09:36:52,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 09:36:52,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:36:51" (1/1) ... [2023-12-19 09:36:52,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 09:36:52,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 09:36:52,105 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-19 09:36:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 09:36:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 09:36:52,127 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 09:36:52,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 09:36:52,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 09:36:52,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 09:36:52,121 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-19 09:36:52,212 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 09:36:52,215 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 09:36:52,563 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 09:36:52,598 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 09:36:52,599 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 09:36:52,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 09:36:52 BoogieIcfgContainer [2023-12-19 09:36:52,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 09:36:52,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 09:36:52,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 09:36:52,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 09:36:52,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 09:36:51" (1/3) ... [2023-12-19 09:36:52,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671de30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 09:36:52, skipping insertion in model container [2023-12-19 09:36:52,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:36:51" (2/3) ... [2023-12-19 09:36:52,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671de30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 09:36:52, skipping insertion in model container [2023-12-19 09:36:52,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 09:36:52" (3/3) ... [2023-12-19 09:36:52,606 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i [2023-12-19 09:36:52,618 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 09:36:52,618 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 09:36:52,664 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 09:36:52,670 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;@787dcd06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 09:36:52,670 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 09:36:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 62 states have internal predecessors, (96), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 09:36:52,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-19 09:36:52,688 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 09:36:52,688 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:36:52,689 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 09:36:52,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 09:36:52,692 INFO L85 PathProgramCache]: Analyzing trace with hash 300904137, now seen corresponding path program 1 times [2023-12-19 09:36:52,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 09:36:52,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433216489] [2023-12-19 09:36:52,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 09:36:52,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 09:36:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:52,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 09:36:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:52,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 09:36:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:52,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 09:36:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:52,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 09:36:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:52,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 09:36:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:52,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 09:36:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:52,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 09:36:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:52,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 09:36:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:52,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 09:36:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:52,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 09:36:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:52,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 09:36:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:52,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 09:36:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:52,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 09:36:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:52,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 09:36:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 09:36:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 09:36:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 09:36:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 09:36:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 09:36:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 09:36:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-19 09:36:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-19 09:36:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-19 09:36:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 09:36:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-19 09:36:53,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 09:36:53,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433216489] [2023-12-19 09:36:53,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433216489] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 09:36:53,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 09:36:53,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 09:36:53,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425650607] [2023-12-19 09:36:53,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 09:36:53,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 09:36:53,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 09:36:53,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 09:36:53,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 09:36:53,124 INFO L87 Difference]: Start difference. First operand has 88 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 62 states have internal predecessors, (96), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-19 09:36:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 09:36:53,190 INFO L93 Difference]: Finished difference Result 173 states and 310 transitions. [2023-12-19 09:36:53,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 09:36:53,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2023-12-19 09:36:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 09:36:53,201 INFO L225 Difference]: With dead ends: 173 [2023-12-19 09:36:53,201 INFO L226 Difference]: Without dead ends: 86 [2023-12-19 09:36:53,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 09:36:53,207 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 09:36:53,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 09:36:53,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-19 09:36:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-19 09:36:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.5) internal successors, (90), 60 states have internal predecessors, (90), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 09:36:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2023-12-19 09:36:53,246 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 161 [2023-12-19 09:36:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 09:36:53,246 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2023-12-19 09:36:53,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-19 09:36:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2023-12-19 09:36:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-19 09:36:53,249 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 09:36:53,249 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:36:53,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 09:36:53,250 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 09:36:53,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 09:36:53,250 INFO L85 PathProgramCache]: Analyzing trace with hash -469619854, now seen corresponding path program 1 times [2023-12-19 09:36:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 09:36:53,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639145298] [2023-12-19 09:36:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 09:36:53,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 09:36:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 09:36:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 09:36:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 09:36:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 09:36:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 09:36:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 09:36:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 09:36:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 09:36:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 09:36:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 09:36:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 09:36:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 09:36:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 09:36:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 09:36:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 09:36:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 09:36:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 09:36:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 09:36:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 09:36:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 09:36:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-19 09:36:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-19 09:36:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-19 09:36:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 09:36:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-19 09:36:53,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 09:36:53,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639145298] [2023-12-19 09:36:53,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639145298] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 09:36:53,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 09:36:53,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 09:36:53,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807668374] [2023-12-19 09:36:53,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 09:36:53,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 09:36:53,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 09:36:53,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 09:36:53,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 09:36:53,530 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-19 09:36:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 09:36:53,634 INFO L93 Difference]: Finished difference Result 256 states and 412 transitions. [2023-12-19 09:36:53,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 09:36:53,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2023-12-19 09:36:53,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 09:36:53,641 INFO L225 Difference]: With dead ends: 256 [2023-12-19 09:36:53,641 INFO L226 Difference]: Without dead ends: 171 [2023-12-19 09:36:53,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-19 09:36:53,644 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 85 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 09:36:53,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 269 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 09:36:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-19 09:36:53,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2023-12-19 09:36:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 09:36:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 272 transitions. [2023-12-19 09:36:53,671 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 272 transitions. Word has length 162 [2023-12-19 09:36:53,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 09:36:53,672 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 272 transitions. [2023-12-19 09:36:53,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-19 09:36:53,672 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 272 transitions. [2023-12-19 09:36:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-19 09:36:53,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 09:36:53,674 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:36:53,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 09:36:53,674 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 09:36:53,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 09:36:53,675 INFO L85 PathProgramCache]: Analyzing trace with hash -2057967756, now seen corresponding path program 1 times [2023-12-19 09:36:53,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 09:36:53,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696976891] [2023-12-19 09:36:53,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 09:36:53,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 09:36:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 09:36:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 09:36:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 09:36:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 09:36:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 09:36:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 09:36:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 09:36:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 09:36:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 09:36:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 09:36:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 09:36:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 09:36:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 09:36:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 09:36:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 09:36:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 09:36:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 09:36:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 09:36:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 09:36:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 09:36:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-19 09:36:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-19 09:36:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-19 09:36:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 09:36:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:53,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-19 09:36:53,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 09:36:53,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696976891] [2023-12-19 09:36:53,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696976891] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 09:36:53,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 09:36:53,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 09:36:53,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414942910] [2023-12-19 09:36:53,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 09:36:53,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 09:36:53,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 09:36:53,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 09:36:53,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 09:36:53,827 INFO L87 Difference]: Start difference. First operand 169 states and 272 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-19 09:36:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 09:36:53,906 INFO L93 Difference]: Finished difference Result 499 states and 802 transitions. [2023-12-19 09:36:53,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 09:36:53,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2023-12-19 09:36:53,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 09:36:53,909 INFO L225 Difference]: With dead ends: 499 [2023-12-19 09:36:53,909 INFO L226 Difference]: Without dead ends: 331 [2023-12-19 09:36:53,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-19 09:36:53,910 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 122 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 09:36:53,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 273 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 09:36:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-12-19 09:36:53,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2023-12-19 09:36:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 228 states have (on average 1.4385964912280702) internal successors, (328), 228 states have internal predecessors, (328), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-19 09:36:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 520 transitions. [2023-12-19 09:36:53,962 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 520 transitions. Word has length 162 [2023-12-19 09:36:53,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 09:36:53,964 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 520 transitions. [2023-12-19 09:36:53,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-19 09:36:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 520 transitions. [2023-12-19 09:36:53,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-19 09:36:53,970 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 09:36:53,970 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:36:53,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 09:36:53,971 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 09:36:53,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 09:36:53,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1471161742, now seen corresponding path program 1 times [2023-12-19 09:36:53,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 09:36:53,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437564138] [2023-12-19 09:36:53,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 09:36:53,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 09:36:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 09:36:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 09:36:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 09:36:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 09:36:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 09:36:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 09:36:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 09:36:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 09:36:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 09:36:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 09:36:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 09:36:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 09:36:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 09:36:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 09:36:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 09:36:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 09:36:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 09:36:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 09:36:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 09:36:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 09:36:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-19 09:36:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-19 09:36:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-19 09:36:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 09:36:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-19 09:36:54,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 09:36:54,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437564138] [2023-12-19 09:36:54,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437564138] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 09:36:54,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 09:36:54,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 09:36:54,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833021588] [2023-12-19 09:36:54,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 09:36:54,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 09:36:54,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 09:36:54,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 09:36:54,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 09:36:54,279 INFO L87 Difference]: Start difference. First operand 329 states and 520 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-19 09:36:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 09:36:54,412 INFO L93 Difference]: Finished difference Result 744 states and 1178 transitions. [2023-12-19 09:36:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 09:36:54,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2023-12-19 09:36:54,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 09:36:54,418 INFO L225 Difference]: With dead ends: 744 [2023-12-19 09:36:54,418 INFO L226 Difference]: Without dead ends: 579 [2023-12-19 09:36:54,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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-19 09:36:54,428 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 147 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 09:36:54,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 410 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 09:36:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2023-12-19 09:36:54,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 495. [2023-12-19 09:36:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 344 states have (on average 1.4244186046511629) internal successors, (490), 344 states have internal predecessors, (490), 144 states have call successors, (144), 6 states have call predecessors, (144), 6 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2023-12-19 09:36:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 778 transitions. [2023-12-19 09:36:54,485 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 778 transitions. Word has length 162 [2023-12-19 09:36:54,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 09:36:54,486 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 778 transitions. [2023-12-19 09:36:54,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-19 09:36:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 778 transitions. [2023-12-19 09:36:54,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-19 09:36:54,488 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 09:36:54,488 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:36:54,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 09:36:54,488 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 09:36:54,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 09:36:54,489 INFO L85 PathProgramCache]: Analyzing trace with hash 686896349, now seen corresponding path program 1 times [2023-12-19 09:36:54,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 09:36:54,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22825866] [2023-12-19 09:36:54,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 09:36:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 09:36:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 09:36:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 09:36:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 09:36:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 09:36:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 09:36:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 09:36:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 09:36:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 09:36:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 09:36:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 09:36:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 09:36:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 09:36:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 09:36:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 09:36:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 09:36:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 09:36:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 09:36:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 09:36:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 09:36:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 09:36:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-19 09:36:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-19 09:36:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-19 09:36:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 09:36:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-19 09:36:54,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 09:36:54,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22825866] [2023-12-19 09:36:54,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22825866] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 09:36:54,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049502170] [2023-12-19 09:36:54,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 09:36:54,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 09:36:54,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 09:36:54,822 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-19 09:36:54,840 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-19 09:36:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:54,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-19 09:36:54,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 09:36:55,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 09:36:55,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 09:36:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-19 09:36:55,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049502170] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 09:36:55,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 09:36:55,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-12-19 09:36:55,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757195819] [2023-12-19 09:36:55,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 09:36:55,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 09:36:55,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 09:36:55,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 09:36:55,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-19 09:36:55,488 INFO L87 Difference]: Start difference. First operand 495 states and 778 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2023-12-19 09:36:55,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 09:36:55,743 INFO L93 Difference]: Finished difference Result 734 states and 1134 transitions. [2023-12-19 09:36:55,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 09:36:55,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 163 [2023-12-19 09:36:55,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 09:36:55,746 INFO L225 Difference]: With dead ends: 734 [2023-12-19 09:36:55,746 INFO L226 Difference]: Without dead ends: 406 [2023-12-19 09:36:55,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 369 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2023-12-19 09:36:55,747 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 174 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 09:36:55,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 411 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 09:36:55,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2023-12-19 09:36:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 351. [2023-12-19 09:36:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 246 states have (on average 1.3821138211382114) internal successors, (340), 246 states have internal predecessors, (340), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-19 09:36:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 532 transitions. [2023-12-19 09:36:55,788 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 532 transitions. Word has length 163 [2023-12-19 09:36:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 09:36:55,788 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 532 transitions. [2023-12-19 09:36:55,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2023-12-19 09:36:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 532 transitions. [2023-12-19 09:36:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-19 09:36:55,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 09:36:55,790 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:36:55,799 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-19 09:36:55,998 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-19 09:36:55,999 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 09:36:55,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 09:36:55,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1177427830, now seen corresponding path program 1 times [2023-12-19 09:36:55,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 09:36:55,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353014128] [2023-12-19 09:36:55,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 09:36:56,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 09:36:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 09:36:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 09:36:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 09:36:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 09:36:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 09:36:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 09:36:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 09:36:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 09:36:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 09:36:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 09:36:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 09:36:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 09:36:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 09:36:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 09:36:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 09:36:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 09:36:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 09:36:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 09:36:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 09:36:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 09:36:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-19 09:36:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-19 09:36:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-19 09:36:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 09:36:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-19 09:36:56,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 09:36:56,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353014128] [2023-12-19 09:36:56,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353014128] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 09:36:56,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 09:36:56,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 09:36:56,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174896442] [2023-12-19 09:36:56,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 09:36:56,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 09:36:56,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 09:36:56,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 09:36:56,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 09:36:56,112 INFO L87 Difference]: Start difference. First operand 351 states and 532 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-19 09:36:56,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 09:36:56,163 INFO L93 Difference]: Finished difference Result 701 states and 1063 transitions. [2023-12-19 09:36:56,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 09:36:56,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2023-12-19 09:36:56,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 09:36:56,165 INFO L225 Difference]: With dead ends: 701 [2023-12-19 09:36:56,165 INFO L226 Difference]: Without dead ends: 351 [2023-12-19 09:36:56,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-19 09:36:56,166 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 20 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 09:36:56,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 214 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 09:36:56,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-12-19 09:36:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2023-12-19 09:36:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 246 states have (on average 1.3658536585365855) internal successors, (336), 246 states have internal predecessors, (336), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-19 09:36:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 528 transitions. [2023-12-19 09:36:56,201 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 528 transitions. Word has length 164 [2023-12-19 09:36:56,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 09:36:56,201 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 528 transitions. [2023-12-19 09:36:56,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-19 09:36:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 528 transitions. [2023-12-19 09:36:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-19 09:36:56,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 09:36:56,202 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:36:56,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 09:36:56,203 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 09:36:56,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 09:36:56,203 INFO L85 PathProgramCache]: Analyzing trace with hash -956466764, now seen corresponding path program 1 times [2023-12-19 09:36:56,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 09:36:56,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648221576] [2023-12-19 09:36:56,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 09:36:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 09:36:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 09:36:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 09:36:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 09:36:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 09:36:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 09:36:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 09:36:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 09:36:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 09:36:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 09:36:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 09:36:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 09:36:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 09:36:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 09:36:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 09:36:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 09:36:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 09:36:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 09:36:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 09:36:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 09:36:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 09:36:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-19 09:36:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-19 09:36:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-19 09:36:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 09:36:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 09:36:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-19 09:36:56,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 09:36:56,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648221576] [2023-12-19 09:36:56,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648221576] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 09:36:56,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 09:36:56,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 09:36:56,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697994542] [2023-12-19 09:36:56,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 09:36:56,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 09:36:56,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 09:36:56,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 09:36:56,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 09:36:56,351 INFO L87 Difference]: Start difference. First operand 351 states and 528 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-19 09:36:56,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 09:36:56,543 INFO L93 Difference]: Finished difference Result 623 states and 933 transitions. [2023-12-19 09:36:56,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 09:36:56,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2023-12-19 09:36:56,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 09:36:56,545 INFO L225 Difference]: With dead ends: 623 [2023-12-19 09:36:56,545 INFO L226 Difference]: Without dead ends: 273 [2023-12-19 09:36:56,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 09:36:56,546 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 154 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 09:36:56,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 455 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 09:36:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-12-19 09:36:56,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 242. [2023-12-19 09:36:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 163 states have (on average 1.3190184049079754) internal successors, (215), 163 states have internal predecessors, (215), 72 states have call successors, (72), 6 states have call predecessors, (72), 6 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-19 09:36:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2023-12-19 09:36:56,574 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 165 [2023-12-19 09:36:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 09:36:56,577 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2023-12-19 09:36:56,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-19 09:36:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2023-12-19 09:36:56,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-19 09:36:56,578 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 09:36:56,578 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:36:56,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 09:36:56,579 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 09:36:56,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 09:36:56,579 INFO L85 PathProgramCache]: Analyzing trace with hash 323396914, now seen corresponding path program 1 times [2023-12-19 09:36:56,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 09:36:56,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625563413] [2023-12-19 09:36:56,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 09:36:56,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 09:36:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 09:36:56,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 09:36:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 09:36:56,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 09:36:56,739 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 09:36:56,740 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 09:36:56,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 09:36:56,743 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 09:36:56,746 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 09:36:56,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 09:36:56 BoogieIcfgContainer [2023-12-19 09:36:56,820 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 09:36:56,820 INFO L158 Benchmark]: Toolchain (without parser) took 5144.24ms. Allocated memory was 245.4MB in the beginning and 364.9MB in the end (delta: 119.5MB). Free memory was 197.2MB in the beginning and 299.6MB in the end (delta: -102.4MB). Peak memory consumption was 172.6MB. Max. memory is 8.0GB. [2023-12-19 09:36:56,820 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 204.5MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 09:36:56,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.50ms. Allocated memory is still 245.4MB. Free memory was 197.2MB in the beginning and 182.0MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-19 09:36:56,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.54ms. Allocated memory is still 245.4MB. Free memory was 182.0MB in the beginning and 179.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 09:36:56,821 INFO L158 Benchmark]: Boogie Preprocessor took 49.23ms. Allocated memory is still 245.4MB. Free memory was 179.3MB in the beginning and 176.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 09:36:56,821 INFO L158 Benchmark]: RCFGBuilder took 547.13ms. Allocated memory is still 245.4MB. Free memory was 176.2MB in the beginning and 153.7MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-19 09:36:56,821 INFO L158 Benchmark]: TraceAbstraction took 4218.52ms. Allocated memory was 245.4MB in the beginning and 364.9MB in the end (delta: 119.5MB). Free memory was 152.6MB in the beginning and 299.6MB in the end (delta: -147.0MB). Peak memory consumption was 128.5MB. Max. memory is 8.0GB. [2023-12-19 09:36:56,822 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.57ms. Allocated memory is still 204.5MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 258.50ms. Allocated memory is still 245.4MB. Free memory was 197.2MB in the beginning and 182.0MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.54ms. Allocated memory is still 245.4MB. Free memory was 182.0MB in the beginning and 179.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.23ms. Allocated memory is still 245.4MB. Free memory was 179.3MB in the beginning and 176.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 547.13ms. Allocated memory is still 245.4MB. Free memory was 176.2MB in the beginning and 153.7MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4218.52ms. Allocated memory was 245.4MB in the beginning and 364.9MB in the end (delta: 119.5MB). Free memory was 152.6MB in the beginning and 299.6MB in the end (delta: -147.0MB). Peak memory consumption was 128.5MB. 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 someBinaryDOUBLEComparisonOperation at line 198, overapproximation of someBinaryArithmeticDOUBLEoperation at line 134. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] signed short int var_1_19 = -64; [L36] double var_1_21 = 100.4; [L37] signed long int var_1_24 = 10; [L38] signed char var_1_25 = -8; [L39] double var_1_26 = 9.75; [L40] signed char var_1_28 = 8; [L41] unsigned long int var_1_29 = 16; [L42] unsigned long int var_1_30 = 1; [L43] float var_1_31 = 16.6; [L44] signed short int var_1_35 = 256; [L45] unsigned long int var_1_36 = 16; [L46] double var_1_37 = 8.5; [L47] unsigned long int var_1_38 = 3569725445; [L48] unsigned long int var_1_39 = 3551809449; [L49] unsigned long int var_1_40 = 10000000; [L50] unsigned char last_1_var_1_1 = 1; [L51] signed long int last_1_var_1_11 = -2; [L52] signed long int last_1_var_1_15 = 1000; [L53] double last_1_var_1_16 = 0.2; [L202] isInitial = 1 [L203] FCALL initially() [L204] COND TRUE 1 [L205] CALL updateLastVariables() [L192] last_1_var_1_1 = var_1_1 [L193] last_1_var_1_11 = var_1_11 [L194] last_1_var_1_15 = var_1_15 [L195] last_1_var_1_16 = var_1_16 [L205] RET updateLastVariables() [L206] CALL updateVariables() [L151] var_1_4 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L152] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L153] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L153] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L154] var_1_7 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L155] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L156] var_1_10 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L157] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L158] var_1_13 = __VERIFIER_nondet_long() [L159] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L159] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L160] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L160] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L161] var_1_14 = __VERIFIER_nondet_long() [L162] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L162] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L163] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L163] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L164] var_1_17 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L165] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L166] var_1_18 = __VERIFIER_nondet_double() [L167] 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_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L167] 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_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L168] var_1_21 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L169] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L170] var_1_26 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L171] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L172] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L172] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L173] var_1_28 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_28 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L174] RET assume_abort_if_not(var_1_28 >= -127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L175] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L175] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L176] var_1_30 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L177] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L178] CALL assume_abort_if_not(var_1_30 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L178] RET assume_abort_if_not(var_1_30 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L179] var_1_37 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L180] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L181] var_1_38 = __VERIFIER_nondet_ulong() [L182] CALL assume_abort_if_not(var_1_38 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L182] RET assume_abort_if_not(var_1_38 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L183] CALL assume_abort_if_not(var_1_38 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L183] RET assume_abort_if_not(var_1_38 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L184] var_1_39 = __VERIFIER_nondet_ulong() [L185] CALL assume_abort_if_not(var_1_39 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L185] RET assume_abort_if_not(var_1_39 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L186] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L186] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L187] var_1_40 = __VERIFIER_nondet_ulong() [L188] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L188] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L189] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L189] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L206] RET updateVariables() [L207] CALL step() [L57] COND TRUE (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - var_1_21) == (var_1_16 * var_1_7) [L58] var_1_19 = -4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L60] var_1_24 = var_1_11 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L61] COND TRUE var_1_21 != var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L62] COND TRUE var_1_5 < (var_1_10 / var_1_26) [L63] var_1_25 = ((((4) < 0 ) ? -(4) : (4))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L74] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L75] COND FALSE !(var_1_7 > var_1_17) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L82] COND TRUE \read(var_1_1) [L83] var_1_31 = ((((((((var_1_7) < (var_1_18)) ? (var_1_7) : (var_1_18))) < 0 ) ? -((((var_1_7) < (var_1_18)) ? (var_1_7) : (var_1_18))) : ((((var_1_7) < (var_1_18)) ? (var_1_7) : (var_1_18))))) - 256.35f) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L86] COND TRUE ! ((1 + var_1_11) <= var_1_11) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L87] COND FALSE !(var_1_11 > (((((((-5) < 0 ) ? -(-5) : (-5))) < 0 ) ? -((((-5) < 0 ) ? -(-5) : (-5))) : ((((-5) < 0 ) ? -(-5) : (-5)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L91] COND FALSE !(var_1_21 < var_1_7) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L98] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L99] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L100] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L105] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L106] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L107] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L109] signed long int stepLocal_2 = var_1_11; [L110] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L111] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L112] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L113] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L114] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L120] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L120] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L131] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=4, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L133] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L134] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=4, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L138] COND FALSE !(10.55f < var_1_16) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=4, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L143] COND TRUE var_1_16 > var_1_7 [L144] var_1_8 = var_1_10 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_10=100000000000004, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=4, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L207] RET step() [L208] CALL, EXPR property() [L198] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=4, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L198-L199] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L208] RET, EXPR property() [L208] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=4, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=4, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 8, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 703 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 702 mSDsluCounter, 2167 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1171 mSDsCounter, 206 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 512 IncrementalHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 206 mSolverCounterUnsat, 996 mSDtfsCounter, 512 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 722 GetRequests, 693 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=495occurred in iteration=4, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 174 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1467 NumberOfCodeBlocks, 1467 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1456 ConstructedInterpolants, 0 QuantifiedInterpolants, 4136 SizeOfPredicates, 4 NumberOfNonLiveVariables, 386 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 9729/9936 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-19 09:36:56,837 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...