/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 02:36:05,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 02:36:05,853 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-21 02:36:05,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 02:36:05,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 02:36:05,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 02:36:05,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 02:36:05,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 02:36:05,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 02:36:05,892 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 02:36:05,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 02:36:05,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 02:36:05,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 02:36:05,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 02:36:05,895 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 02:36:05,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 02:36:05,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 02:36:05,895 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 02:36:05,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 02:36:05,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 02:36:05,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 02:36:05,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 02:36:05,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 02:36:05,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 02:36:05,897 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 02:36:05,897 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 02:36:05,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 02:36:05,898 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 02:36:05,898 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 02:36:05,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 02:36:05,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 02:36:05,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 02:36:05,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:36:05,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 02:36:05,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 02:36:05,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 02:36:05,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 02:36:05,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 02:36:05,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 02:36:05,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 02:36:05,900 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 02:36:05,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 02:36:05,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 02:36:05,901 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 02:36:06,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 02:36:06,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 02:36:06,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 02:36:06,095 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 02:36:06,096 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 02:36:06,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i [2023-12-21 02:36:07,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 02:36:07,277 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 02:36:07,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i [2023-12-21 02:36:07,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f458b925d/75063b085434486e93d418994245807a/FLAG2483f87e9 [2023-12-21 02:36:07,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f458b925d/75063b085434486e93d418994245807a [2023-12-21 02:36:07,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 02:36:07,303 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 02:36:07,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 02:36:07,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 02:36:07,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 02:36:07,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:36:07" (1/1) ... [2023-12-21 02:36:07,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772b2145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:07, skipping insertion in model container [2023-12-21 02:36:07,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:36:07" (1/1) ... [2023-12-21 02:36:07,336 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 02:36:07,426 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_variablewrapping_wrapper-sp_file-34.i[917,930] [2023-12-21 02:36:07,461 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:36:07,477 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 02:36:07,485 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_variablewrapping_wrapper-sp_file-34.i[917,930] [2023-12-21 02:36:07,506 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:36:07,522 INFO L206 MainTranslator]: Completed translation [2023-12-21 02:36:07,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:07 WrapperNode [2023-12-21 02:36:07,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 02:36:07,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 02:36:07,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 02:36:07,524 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 02:36:07,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:07" (1/1) ... [2023-12-21 02:36:07,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:07" (1/1) ... [2023-12-21 02:36:07,572 INFO L138 Inliner]: procedures = 29, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 451 [2023-12-21 02:36:07,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 02:36:07,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 02:36:07,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 02:36:07,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 02:36:07,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:07" (1/1) ... [2023-12-21 02:36:07,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:07" (1/1) ... [2023-12-21 02:36:07,585 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:07" (1/1) ... [2023-12-21 02:36:07,612 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 18 writes are split as follows [0, 18]. [2023-12-21 02:36:07,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:07" (1/1) ... [2023-12-21 02:36:07,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:07" (1/1) ... [2023-12-21 02:36:07,622 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:07" (1/1) ... [2023-12-21 02:36:07,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:07" (1/1) ... [2023-12-21 02:36:07,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:07" (1/1) ... [2023-12-21 02:36:07,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:07" (1/1) ... [2023-12-21 02:36:07,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 02:36:07,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 02:36:07,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 02:36:07,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 02:36:07,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:07" (1/1) ... [2023-12-21 02:36:07,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:36:07,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:36:07,709 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-21 02:36:07,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 02:36:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 02:36:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 02:36:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 02:36:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 02:36:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 02:36:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 02:36:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 02:36:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 02:36:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 02:36:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 02:36:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 02:36:07,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 02:36:07,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 02:36:07,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 02:36:07,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 02:36:07,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 02:36:07,726 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-21 02:36:07,855 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 02:36:07,857 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 02:36:08,265 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 02:36:08,287 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 02:36:08,287 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 02:36:08,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:36:08 BoogieIcfgContainer [2023-12-21 02:36:08,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 02:36:08,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 02:36:08,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 02:36:08,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 02:36:08,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:36:07" (1/3) ... [2023-12-21 02:36:08,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c95f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:36:08, skipping insertion in model container [2023-12-21 02:36:08,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:07" (2/3) ... [2023-12-21 02:36:08,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c95f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:36:08, skipping insertion in model container [2023-12-21 02:36:08,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:36:08" (3/3) ... [2023-12-21 02:36:08,293 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-34.i [2023-12-21 02:36:08,307 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 02:36:08,307 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 02:36:08,338 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 02:36:08,344 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;@3d331dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 02:36:08,344 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 02:36:08,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:36:08,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-12-21 02:36:08,362 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:08,362 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:08,363 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:08,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:08,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1982887210, now seen corresponding path program 1 times [2023-12-21 02:36:08,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:08,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705257980] [2023-12-21 02:36:08,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:08,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:08,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705257980] [2023-12-21 02:36:08,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705257980] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:08,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:08,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 02:36:08,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580907116] [2023-12-21 02:36:08,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:08,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 02:36:08,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:08,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 02:36:08,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:36:08,823 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-21 02:36:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:08,871 INFO L93 Difference]: Finished difference Result 223 states and 357 transitions. [2023-12-21 02:36:08,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 02:36:08,873 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2023-12-21 02:36:08,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:08,881 INFO L225 Difference]: With dead ends: 223 [2023-12-21 02:36:08,881 INFO L226 Difference]: Without dead ends: 111 [2023-12-21 02:36:08,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-21 02:36:08,888 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:08,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:36:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-21 02:36:08,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-12-21 02:36:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:36:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2023-12-21 02:36:08,936 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 166 [2023-12-21 02:36:08,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:08,937 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2023-12-21 02:36:08,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-21 02:36:08,937 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2023-12-21 02:36:08,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-12-21 02:36:08,942 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:08,942 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:08,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 02:36:08,943 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:08,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:08,943 INFO L85 PathProgramCache]: Analyzing trace with hash 799028980, now seen corresponding path program 1 times [2023-12-21 02:36:08,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:08,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462666501] [2023-12-21 02:36:08,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:08,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:09,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:09,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462666501] [2023-12-21 02:36:09,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462666501] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:09,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:09,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:36:09,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799417161] [2023-12-21 02:36:09,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:09,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:36:09,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:09,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:36:09,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:36:09,243 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:09,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:09,288 INFO L93 Difference]: Finished difference Result 222 states and 327 transitions. [2023-12-21 02:36:09,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:36:09,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2023-12-21 02:36:09,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:09,293 INFO L225 Difference]: With dead ends: 222 [2023-12-21 02:36:09,294 INFO L226 Difference]: Without dead ends: 112 [2023-12-21 02:36:09,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-21 02:36:09,295 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:09,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:36:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-21 02:36:09,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-12-21 02:36:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:36:09,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2023-12-21 02:36:09,303 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 166 [2023-12-21 02:36:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:09,306 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2023-12-21 02:36:09,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2023-12-21 02:36:09,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-12-21 02:36:09,312 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:09,312 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:09,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 02:36:09,312 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:09,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:09,312 INFO L85 PathProgramCache]: Analyzing trace with hash -889914762, now seen corresponding path program 1 times [2023-12-21 02:36:09,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:09,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029730500] [2023-12-21 02:36:09,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:09,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:09,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:09,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029730500] [2023-12-21 02:36:09,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029730500] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:09,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:09,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:36:09,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151438744] [2023-12-21 02:36:09,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:09,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:36:09,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:09,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:36:09,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:36:09,585 INFO L87 Difference]: Start difference. First operand 112 states and 164 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:09,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:09,637 INFO L93 Difference]: Finished difference Result 247 states and 363 transitions. [2023-12-21 02:36:09,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:36:09,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2023-12-21 02:36:09,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:09,642 INFO L225 Difference]: With dead ends: 247 [2023-12-21 02:36:09,643 INFO L226 Difference]: Without dead ends: 136 [2023-12-21 02:36:09,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-21 02:36:09,645 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 61 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:09,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 487 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:36:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-21 02:36:09,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 114. [2023-12-21 02:36:09,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:36:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 166 transitions. [2023-12-21 02:36:09,652 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 166 transitions. Word has length 166 [2023-12-21 02:36:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:09,653 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 166 transitions. [2023-12-21 02:36:09,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 166 transitions. [2023-12-21 02:36:09,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-21 02:36:09,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:09,654 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:09,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 02:36:09,654 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:09,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:09,655 INFO L85 PathProgramCache]: Analyzing trace with hash -543757980, now seen corresponding path program 1 times [2023-12-21 02:36:09,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:09,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523836480] [2023-12-21 02:36:09,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:09,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:09,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:09,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523836480] [2023-12-21 02:36:09,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523836480] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:09,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:09,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:36:09,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713720676] [2023-12-21 02:36:09,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:09,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:36:09,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:09,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:36:09,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:36:09,796 INFO L87 Difference]: Start difference. First operand 114 states and 166 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:09,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:09,832 INFO L93 Difference]: Finished difference Result 276 states and 402 transitions. [2023-12-21 02:36:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:36:09,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 168 [2023-12-21 02:36:09,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:09,835 INFO L225 Difference]: With dead ends: 276 [2023-12-21 02:36:09,835 INFO L226 Difference]: Without dead ends: 163 [2023-12-21 02:36:09,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-21 02:36:09,840 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 56 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:09,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 309 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:36:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-12-21 02:36:09,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 133. [2023-12-21 02:36:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:36:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2023-12-21 02:36:09,853 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 168 [2023-12-21 02:36:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:09,854 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2023-12-21 02:36:09,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:09,854 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2023-12-21 02:36:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-21 02:36:09,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:09,855 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:09,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 02:36:09,855 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:09,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:09,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1410011260, now seen corresponding path program 1 times [2023-12-21 02:36:09,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:09,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955016306] [2023-12-21 02:36:09,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:09,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:09,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:09,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955016306] [2023-12-21 02:36:09,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955016306] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:09,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:09,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:36:09,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765415334] [2023-12-21 02:36:09,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:09,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:36:09,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:09,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:36:09,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:36:09,987 INFO L87 Difference]: Start difference. First operand 133 states and 194 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:10,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:10,008 INFO L93 Difference]: Finished difference Result 280 states and 409 transitions. [2023-12-21 02:36:10,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:36:10,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2023-12-21 02:36:10,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:10,009 INFO L225 Difference]: With dead ends: 280 [2023-12-21 02:36:10,009 INFO L226 Difference]: Without dead ends: 148 [2023-12-21 02:36:10,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-21 02:36:10,010 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 26 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:10,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 324 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:36:10,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-12-21 02:36:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 134. [2023-12-21 02:36:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 109 states have internal predecessors, (149), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:36:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 195 transitions. [2023-12-21 02:36:10,028 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 195 transitions. Word has length 171 [2023-12-21 02:36:10,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:10,028 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 195 transitions. [2023-12-21 02:36:10,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:10,029 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 195 transitions. [2023-12-21 02:36:10,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-21 02:36:10,030 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:10,030 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:10,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 02:36:10,031 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:10,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:10,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1151845822, now seen corresponding path program 1 times [2023-12-21 02:36:10,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:10,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374101799] [2023-12-21 02:36:10,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:10,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:10,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:10,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374101799] [2023-12-21 02:36:10,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374101799] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:10,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:10,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 02:36:10,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430226149] [2023-12-21 02:36:10,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:10,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:36:10,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:10,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:36:10,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:36:10,865 INFO L87 Difference]: Start difference. First operand 134 states and 195 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:11,131 INFO L93 Difference]: Finished difference Result 334 states and 483 transitions. [2023-12-21 02:36:11,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 02:36:11,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2023-12-21 02:36:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:11,134 INFO L225 Difference]: With dead ends: 334 [2023-12-21 02:36:11,134 INFO L226 Difference]: Without dead ends: 201 [2023-12-21 02:36:11,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-12-21 02:36:11,136 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 165 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:11,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1040 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:36:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-21 02:36:11,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 163. [2023-12-21 02:36:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.3695652173913044) internal successors, (189), 138 states have internal predecessors, (189), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:36:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 235 transitions. [2023-12-21 02:36:11,146 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 235 transitions. Word has length 171 [2023-12-21 02:36:11,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:11,147 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 235 transitions. [2023-12-21 02:36:11,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:11,147 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 235 transitions. [2023-12-21 02:36:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-21 02:36:11,149 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:11,149 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:11,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 02:36:11,149 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:11,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:11,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1544872832, now seen corresponding path program 1 times [2023-12-21 02:36:11,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:11,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666140468] [2023-12-21 02:36:11,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:11,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:11,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:11,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666140468] [2023-12-21 02:36:11,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666140468] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:11,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:11,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 02:36:11,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517293609] [2023-12-21 02:36:11,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:11,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:36:11,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:11,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:36:11,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:36:11,803 INFO L87 Difference]: Start difference. First operand 163 states and 235 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-21 02:36:12,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:12,164 INFO L93 Difference]: Finished difference Result 377 states and 542 transitions. [2023-12-21 02:36:12,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:36:12,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2023-12-21 02:36:12,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:12,166 INFO L225 Difference]: With dead ends: 377 [2023-12-21 02:36:12,166 INFO L226 Difference]: Without dead ends: 215 [2023-12-21 02:36:12,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-21 02:36:12,167 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 281 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:12,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 417 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:36:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-21 02:36:12,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 163. [2023-12-21 02:36:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.3623188405797102) internal successors, (188), 138 states have internal predecessors, (188), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:36:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 234 transitions. [2023-12-21 02:36:12,176 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 234 transitions. Word has length 171 [2023-12-21 02:36:12,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:12,178 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 234 transitions. [2023-12-21 02:36:12,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-21 02:36:12,179 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 234 transitions. [2023-12-21 02:36:12,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-21 02:36:12,180 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:12,180 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:12,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 02:36:12,180 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:12,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:12,180 INFO L85 PathProgramCache]: Analyzing trace with hash -932991104, now seen corresponding path program 1 times [2023-12-21 02:36:12,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:12,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560706035] [2023-12-21 02:36:12,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:12,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:12,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:12,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560706035] [2023-12-21 02:36:12,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560706035] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:12,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:12,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 02:36:12,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516228273] [2023-12-21 02:36:12,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:12,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:36:12,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:12,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:36:12,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:36:12,753 INFO L87 Difference]: Start difference. First operand 163 states and 234 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-21 02:36:13,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:13,081 INFO L93 Difference]: Finished difference Result 375 states and 538 transitions. [2023-12-21 02:36:13,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:36:13,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2023-12-21 02:36:13,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:13,083 INFO L225 Difference]: With dead ends: 375 [2023-12-21 02:36:13,083 INFO L226 Difference]: Without dead ends: 213 [2023-12-21 02:36:13,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-21 02:36:13,084 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 183 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:13,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 462 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:36:13,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-12-21 02:36:13,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 186. [2023-12-21 02:36:13,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:36:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 267 transitions. [2023-12-21 02:36:13,094 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 267 transitions. Word has length 171 [2023-12-21 02:36:13,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:13,094 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 267 transitions. [2023-12-21 02:36:13,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-21 02:36:13,094 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 267 transitions. [2023-12-21 02:36:13,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-21 02:36:13,096 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:13,096 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:13,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 02:36:13,096 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:13,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:13,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1326018114, now seen corresponding path program 1 times [2023-12-21 02:36:13,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:13,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146326519] [2023-12-21 02:36:13,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:13,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:14,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:14,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146326519] [2023-12-21 02:36:14,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146326519] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:14,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:14,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 02:36:14,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846243723] [2023-12-21 02:36:14,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:14,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 02:36:14,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:14,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 02:36:14,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:36:14,152 INFO L87 Difference]: Start difference. First operand 186 states and 267 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:14,852 INFO L93 Difference]: Finished difference Result 412 states and 590 transitions. [2023-12-21 02:36:14,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 02:36:14,852 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2023-12-21 02:36:14,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:14,853 INFO L225 Difference]: With dead ends: 412 [2023-12-21 02:36:14,854 INFO L226 Difference]: Without dead ends: 227 [2023-12-21 02:36:14,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-12-21 02:36:14,856 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 259 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:14,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1127 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 02:36:14,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-12-21 02:36:14,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 186. [2023-12-21 02:36:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:36:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 267 transitions. [2023-12-21 02:36:14,867 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 267 transitions. Word has length 171 [2023-12-21 02:36:14,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:14,868 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 267 transitions. [2023-12-21 02:36:14,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 267 transitions. [2023-12-21 02:36:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-21 02:36:14,869 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:14,869 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:14,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 02:36:14,870 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:14,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:14,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1450268400, now seen corresponding path program 1 times [2023-12-21 02:36:14,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:14,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093929298] [2023-12-21 02:36:14,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:14,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:14,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:14,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093929298] [2023-12-21 02:36:14,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093929298] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:14,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:14,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:36:14,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270662107] [2023-12-21 02:36:14,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:14,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:36:14,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:14,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:36:14,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:36:14,982 INFO L87 Difference]: Start difference. First operand 186 states and 267 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:15,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:15,009 INFO L93 Difference]: Finished difference Result 409 states and 586 transitions. [2023-12-21 02:36:15,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:36:15,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2023-12-21 02:36:15,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:15,011 INFO L225 Difference]: With dead ends: 409 [2023-12-21 02:36:15,011 INFO L226 Difference]: Without dead ends: 224 [2023-12-21 02:36:15,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-21 02:36:15,012 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 60 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:15,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 361 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:36:15,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-12-21 02:36:15,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 186. [2023-12-21 02:36:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.329192546583851) internal successors, (214), 161 states have internal predecessors, (214), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:36:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 260 transitions. [2023-12-21 02:36:15,024 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 260 transitions. Word has length 171 [2023-12-21 02:36:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:15,024 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 260 transitions. [2023-12-21 02:36:15,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 260 transitions. [2023-12-21 02:36:15,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 02:36:15,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:15,026 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:15,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 02:36:15,026 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:15,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:15,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1097966277, now seen corresponding path program 1 times [2023-12-21 02:36:15,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:15,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655105154] [2023-12-21 02:36:15,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:15,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:15,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:15,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655105154] [2023-12-21 02:36:15,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655105154] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:15,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:15,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 02:36:15,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532160830] [2023-12-21 02:36:15,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:15,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:36:15,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:15,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:36:15,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:36:15,385 INFO L87 Difference]: Start difference. First operand 186 states and 260 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:15,653 INFO L93 Difference]: Finished difference Result 436 states and 608 transitions. [2023-12-21 02:36:15,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 02:36:15,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 172 [2023-12-21 02:36:15,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:15,655 INFO L225 Difference]: With dead ends: 436 [2023-12-21 02:36:15,655 INFO L226 Difference]: Without dead ends: 251 [2023-12-21 02:36:15,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:36:15,656 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 190 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:15,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 581 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:36:15,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-12-21 02:36:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 199. [2023-12-21 02:36:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 174 states have (on average 1.3218390804597702) internal successors, (230), 174 states have internal predecessors, (230), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:36:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 276 transitions. [2023-12-21 02:36:15,666 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 276 transitions. Word has length 172 [2023-12-21 02:36:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:15,666 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 276 transitions. [2023-12-21 02:36:15,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 276 transitions. [2023-12-21 02:36:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-21 02:36:15,668 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:15,668 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:15,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 02:36:15,668 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:15,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:15,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1774683992, now seen corresponding path program 1 times [2023-12-21 02:36:15,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:15,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105346114] [2023-12-21 02:36:15,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:15,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:15,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:16,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:16,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105346114] [2023-12-21 02:36:16,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105346114] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:16,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:16,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 02:36:16,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177558506] [2023-12-21 02:36:16,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:16,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:36:16,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:16,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:36:16,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:36:16,016 INFO L87 Difference]: Start difference. First operand 199 states and 276 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:16,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:16,338 INFO L93 Difference]: Finished difference Result 480 states and 667 transitions. [2023-12-21 02:36:16,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:36:16,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-12-21 02:36:16,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:16,340 INFO L225 Difference]: With dead ends: 480 [2023-12-21 02:36:16,340 INFO L226 Difference]: Without dead ends: 282 [2023-12-21 02:36:16,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:36:16,341 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 203 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:16,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 565 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:36:16,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-12-21 02:36:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 228. [2023-12-21 02:36:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3251231527093597) internal successors, (269), 203 states have internal predecessors, (269), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:36:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 315 transitions. [2023-12-21 02:36:16,366 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 315 transitions. Word has length 173 [2023-12-21 02:36:16,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:16,367 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 315 transitions. [2023-12-21 02:36:16,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 315 transitions. [2023-12-21 02:36:16,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-21 02:36:16,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:16,368 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:16,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 02:36:16,368 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:16,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:16,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1836723606, now seen corresponding path program 1 times [2023-12-21 02:36:16,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:16,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131363019] [2023-12-21 02:36:16,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:16,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:16,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131363019] [2023-12-21 02:36:16,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131363019] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:16,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:16,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 02:36:16,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817001604] [2023-12-21 02:36:16,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:16,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:36:16,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:16,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:36:16,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:36:16,746 INFO L87 Difference]: Start difference. First operand 228 states and 315 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:16,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:16,992 INFO L93 Difference]: Finished difference Result 519 states and 717 transitions. [2023-12-21 02:36:16,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 02:36:16,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-12-21 02:36:16,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:16,993 INFO L225 Difference]: With dead ends: 519 [2023-12-21 02:36:16,994 INFO L226 Difference]: Without dead ends: 292 [2023-12-21 02:36:16,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-21 02:36:16,995 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 276 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:16,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 574 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:36:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-12-21 02:36:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 212. [2023-12-21 02:36:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 187 states have (on average 1.3262032085561497) internal successors, (248), 187 states have internal predecessors, (248), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:36:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2023-12-21 02:36:17,006 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 173 [2023-12-21 02:36:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:17,008 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2023-12-21 02:36:17,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:17,008 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2023-12-21 02:36:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-21 02:36:17,010 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:17,011 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:17,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 02:36:17,011 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:17,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:17,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1098401000, now seen corresponding path program 1 times [2023-12-21 02:36:17,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:17,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164155379] [2023-12-21 02:36:17,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:17,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:17,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:17,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164155379] [2023-12-21 02:36:17,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164155379] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:17,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:17,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 02:36:17,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377376452] [2023-12-21 02:36:17,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:17,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:36:17,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:17,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:36:17,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:36:17,377 INFO L87 Difference]: Start difference. First operand 212 states and 294 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:17,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:17,649 INFO L93 Difference]: Finished difference Result 473 states and 655 transitions. [2023-12-21 02:36:17,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:36:17,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-12-21 02:36:17,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:17,651 INFO L225 Difference]: With dead ends: 473 [2023-12-21 02:36:17,651 INFO L226 Difference]: Without dead ends: 262 [2023-12-21 02:36:17,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:36:17,652 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 261 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:17,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 424 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:36:17,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-12-21 02:36:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 225. [2023-12-21 02:36:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 200 states have (on average 1.305) internal successors, (261), 200 states have internal predecessors, (261), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:36:17,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 307 transitions. [2023-12-21 02:36:17,663 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 307 transitions. Word has length 173 [2023-12-21 02:36:17,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:17,663 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 307 transitions. [2023-12-21 02:36:17,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:17,664 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 307 transitions. [2023-12-21 02:36:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-21 02:36:17,665 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:17,665 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:17,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 02:36:17,665 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:17,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:17,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2109518250, now seen corresponding path program 1 times [2023-12-21 02:36:17,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:17,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712396495] [2023-12-21 02:36:17,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:17,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:17,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:18,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:18,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712396495] [2023-12-21 02:36:18,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712396495] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:18,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:18,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 02:36:18,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891755794] [2023-12-21 02:36:18,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:18,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:36:18,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:18,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:36:18,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:36:18,029 INFO L87 Difference]: Start difference. First operand 225 states and 307 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:18,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:18,249 INFO L93 Difference]: Finished difference Result 478 states and 653 transitions. [2023-12-21 02:36:18,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:36:18,249 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-12-21 02:36:18,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:18,251 INFO L225 Difference]: With dead ends: 478 [2023-12-21 02:36:18,251 INFO L226 Difference]: Without dead ends: 254 [2023-12-21 02:36:18,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:36:18,252 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 246 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:18,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 427 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:36:18,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-21 02:36:18,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 225. [2023-12-21 02:36:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 200 states have (on average 1.275) internal successors, (255), 200 states have internal predecessors, (255), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:36:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 301 transitions. [2023-12-21 02:36:18,263 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 301 transitions. Word has length 173 [2023-12-21 02:36:18,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:18,263 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 301 transitions. [2023-12-21 02:36:18,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 301 transitions. [2023-12-21 02:36:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-21 02:36:18,264 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:18,264 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:18,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 02:36:18,265 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:18,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:18,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1817118025, now seen corresponding path program 1 times [2023-12-21 02:36:18,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:18,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158925293] [2023-12-21 02:36:18,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:18,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:18,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:18,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158925293] [2023-12-21 02:36:18,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158925293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:18,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:18,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:36:18,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513012855] [2023-12-21 02:36:18,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:18,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:36:18,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:18,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:36:18,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:36:18,425 INFO L87 Difference]: Start difference. First operand 225 states and 301 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:18,461 INFO L93 Difference]: Finished difference Result 455 states and 609 transitions. [2023-12-21 02:36:18,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:36:18,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-12-21 02:36:18,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:18,463 INFO L225 Difference]: With dead ends: 455 [2023-12-21 02:36:18,463 INFO L226 Difference]: Without dead ends: 231 [2023-12-21 02:36:18,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:36:18,464 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 24 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:18,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 599 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:36:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-12-21 02:36:18,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2023-12-21 02:36:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.270935960591133) internal successors, (258), 203 states have internal predecessors, (258), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:36:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 304 transitions. [2023-12-21 02:36:18,477 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 304 transitions. Word has length 173 [2023-12-21 02:36:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:18,477 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 304 transitions. [2023-12-21 02:36:18,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 304 transitions. [2023-12-21 02:36:18,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-21 02:36:18,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:18,479 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:18,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 02:36:18,479 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:18,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:18,479 INFO L85 PathProgramCache]: Analyzing trace with hash 799532139, now seen corresponding path program 1 times [2023-12-21 02:36:18,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:18,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100567153] [2023-12-21 02:36:18,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:18,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:18,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100567153] [2023-12-21 02:36:18,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100567153] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:18,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:18,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:36:18,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361381109] [2023-12-21 02:36:18,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:18,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:36:18,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:18,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:36:18,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:36:18,623 INFO L87 Difference]: Start difference. First operand 228 states and 304 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:18,800 INFO L93 Difference]: Finished difference Result 621 states and 830 transitions. [2023-12-21 02:36:18,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 02:36:18,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-12-21 02:36:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:18,802 INFO L225 Difference]: With dead ends: 621 [2023-12-21 02:36:18,802 INFO L226 Difference]: Without dead ends: 394 [2023-12-21 02:36:18,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-21 02:36:18,803 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 113 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:18,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 385 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:36:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-12-21 02:36:18,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 285. [2023-12-21 02:36:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 236 states have (on average 1.2457627118644068) internal successors, (294), 236 states have internal predecessors, (294), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:18,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 386 transitions. [2023-12-21 02:36:18,825 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 386 transitions. Word has length 173 [2023-12-21 02:36:18,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:18,826 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 386 transitions. [2023-12-21 02:36:18,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 386 transitions. [2023-12-21 02:36:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-21 02:36:18,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:18,827 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:18,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 02:36:18,827 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:18,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:18,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1906828626, now seen corresponding path program 1 times [2023-12-21 02:36:18,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:18,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067967413] [2023-12-21 02:36:18,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:18,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:19,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067967413] [2023-12-21 02:36:19,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067967413] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:19,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:19,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 02:36:19,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302901061] [2023-12-21 02:36:19,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:19,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 02:36:19,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:19,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 02:36:19,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:36:19,260 INFO L87 Difference]: Start difference. First operand 285 states and 386 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:19,509 INFO L93 Difference]: Finished difference Result 621 states and 832 transitions. [2023-12-21 02:36:19,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 02:36:19,510 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-21 02:36:19,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:19,512 INFO L225 Difference]: With dead ends: 621 [2023-12-21 02:36:19,512 INFO L226 Difference]: Without dead ends: 394 [2023-12-21 02:36:19,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2023-12-21 02:36:19,513 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 194 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:19,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1425 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:36:19,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-12-21 02:36:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 336. [2023-12-21 02:36:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 287 states have (on average 1.2508710801393728) internal successors, (359), 287 states have internal predecessors, (359), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 451 transitions. [2023-12-21 02:36:19,537 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 451 transitions. Word has length 175 [2023-12-21 02:36:19,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:19,538 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 451 transitions. [2023-12-21 02:36:19,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 451 transitions. [2023-12-21 02:36:19,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-21 02:36:19,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:19,539 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:19,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-21 02:36:19,539 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:19,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:19,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1995111660, now seen corresponding path program 1 times [2023-12-21 02:36:19,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:19,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022041854] [2023-12-21 02:36:19,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:19,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:19,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:19,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022041854] [2023-12-21 02:36:19,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022041854] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:19,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:19,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:36:19,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963887873] [2023-12-21 02:36:19,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:19,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:36:19,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:19,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:36:19,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:36:19,625 INFO L87 Difference]: Start difference. First operand 336 states and 451 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:19,661 INFO L93 Difference]: Finished difference Result 661 states and 880 transitions. [2023-12-21 02:36:19,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:36:19,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-21 02:36:19,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:19,663 INFO L225 Difference]: With dead ends: 661 [2023-12-21 02:36:19,663 INFO L226 Difference]: Without dead ends: 383 [2023-12-21 02:36:19,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-21 02:36:19,664 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 63 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:19,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 495 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:36:19,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2023-12-21 02:36:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 340. [2023-12-21 02:36:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 291 states have (on average 1.2474226804123711) internal successors, (363), 291 states have internal predecessors, (363), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 455 transitions. [2023-12-21 02:36:19,682 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 455 transitions. Word has length 175 [2023-12-21 02:36:19,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:19,682 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 455 transitions. [2023-12-21 02:36:19,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 455 transitions. [2023-12-21 02:36:19,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-21 02:36:19,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:19,684 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:19,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-21 02:36:19,684 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:19,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:19,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2041690198, now seen corresponding path program 1 times [2023-12-21 02:36:19,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:19,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037681618] [2023-12-21 02:36:19,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:19,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:19,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037681618] [2023-12-21 02:36:19,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037681618] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:19,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:19,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:36:19,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538732978] [2023-12-21 02:36:19,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:19,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:36:19,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:19,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:36:19,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:36:19,982 INFO L87 Difference]: Start difference. First operand 340 states and 455 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:20,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:20,129 INFO L93 Difference]: Finished difference Result 718 states and 950 transitions. [2023-12-21 02:36:20,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 02:36:20,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-21 02:36:20,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:20,131 INFO L225 Difference]: With dead ends: 718 [2023-12-21 02:36:20,131 INFO L226 Difference]: Without dead ends: 436 [2023-12-21 02:36:20,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:36:20,132 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 167 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:20,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 570 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:36:20,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2023-12-21 02:36:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 344. [2023-12-21 02:36:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 295 states have (on average 1.2508474576271187) internal successors, (369), 295 states have internal predecessors, (369), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:20,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 461 transitions. [2023-12-21 02:36:20,152 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 461 transitions. Word has length 175 [2023-12-21 02:36:20,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:20,153 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 461 transitions. [2023-12-21 02:36:20,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 461 transitions. [2023-12-21 02:36:20,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-21 02:36:20,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:20,154 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:20,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-21 02:36:20,154 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:20,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2040842132, now seen corresponding path program 1 times [2023-12-21 02:36:20,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:20,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963282184] [2023-12-21 02:36:20,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:20,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:20,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:20,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963282184] [2023-12-21 02:36:20,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963282184] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:20,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:20,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:36:20,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647372066] [2023-12-21 02:36:20,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:20,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:36:20,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:20,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:36:20,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:36:20,248 INFO L87 Difference]: Start difference. First operand 344 states and 461 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:20,280 INFO L93 Difference]: Finished difference Result 642 states and 855 transitions. [2023-12-21 02:36:20,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:36:20,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-21 02:36:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:20,281 INFO L225 Difference]: With dead ends: 642 [2023-12-21 02:36:20,281 INFO L226 Difference]: Without dead ends: 356 [2023-12-21 02:36:20,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-21 02:36:20,284 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 3 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:20,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 457 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:36:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-12-21 02:36:20,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 352. [2023-12-21 02:36:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 303 states have (on average 1.2442244224422443) internal successors, (377), 303 states have internal predecessors, (377), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 469 transitions. [2023-12-21 02:36:20,304 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 469 transitions. Word has length 175 [2023-12-21 02:36:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:20,304 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 469 transitions. [2023-12-21 02:36:20,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:20,304 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 469 transitions. [2023-12-21 02:36:20,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-21 02:36:20,305 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:20,305 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:20,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-21 02:36:20,306 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:20,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:20,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1978802518, now seen corresponding path program 1 times [2023-12-21 02:36:20,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:20,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172963069] [2023-12-21 02:36:20,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:20,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:20,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:20,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172963069] [2023-12-21 02:36:20,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172963069] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:20,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:20,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:36:20,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435043057] [2023-12-21 02:36:20,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:20,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:36:20,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:20,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:36:20,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:36:20,533 INFO L87 Difference]: Start difference. First operand 352 states and 469 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:20,662 INFO L93 Difference]: Finished difference Result 654 states and 865 transitions. [2023-12-21 02:36:20,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 02:36:20,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-21 02:36:20,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:20,664 INFO L225 Difference]: With dead ends: 654 [2023-12-21 02:36:20,664 INFO L226 Difference]: Without dead ends: 360 [2023-12-21 02:36:20,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:36:20,666 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 110 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:20,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 614 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:36:20,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-12-21 02:36:20,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 325. [2023-12-21 02:36:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 276 states have (on average 1.2391304347826086) internal successors, (342), 276 states have internal predecessors, (342), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 434 transitions. [2023-12-21 02:36:20,686 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 434 transitions. Word has length 175 [2023-12-21 02:36:20,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:20,686 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 434 transitions. [2023-12-21 02:36:20,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:20,686 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 434 transitions. [2023-12-21 02:36:20,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-21 02:36:20,687 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:20,687 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:20,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-21 02:36:20,687 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:20,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:20,688 INFO L85 PathProgramCache]: Analyzing trace with hash 732686758, now seen corresponding path program 1 times [2023-12-21 02:36:20,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:20,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972463554] [2023-12-21 02:36:20,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:20,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:20,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:21,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:21,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972463554] [2023-12-21 02:36:21,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972463554] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:21,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:21,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 02:36:21,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471580511] [2023-12-21 02:36:21,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:21,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:36:21,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:21,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:36:21,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:36:21,022 INFO L87 Difference]: Start difference. First operand 325 states and 434 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:21,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:21,329 INFO L93 Difference]: Finished difference Result 715 states and 941 transitions. [2023-12-21 02:36:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:36:21,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-21 02:36:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:21,331 INFO L225 Difference]: With dead ends: 715 [2023-12-21 02:36:21,331 INFO L226 Difference]: Without dead ends: 448 [2023-12-21 02:36:21,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:36:21,332 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 213 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:21,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 551 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:36:21,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-12-21 02:36:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 377. [2023-12-21 02:36:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 328 states have (on average 1.2378048780487805) internal successors, (406), 328 states have internal predecessors, (406), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 498 transitions. [2023-12-21 02:36:21,350 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 498 transitions. Word has length 175 [2023-12-21 02:36:21,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:21,350 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 498 transitions. [2023-12-21 02:36:21,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 498 transitions. [2023-12-21 02:36:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-21 02:36:21,351 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:21,351 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:21,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-21 02:36:21,352 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:21,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:21,352 INFO L85 PathProgramCache]: Analyzing trace with hash 794726372, now seen corresponding path program 1 times [2023-12-21 02:36:21,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:21,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176005369] [2023-12-21 02:36:21,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:21,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:21,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:21,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176005369] [2023-12-21 02:36:21,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176005369] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:21,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:21,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:36:21,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672042611] [2023-12-21 02:36:21,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:21,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:36:21,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:21,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:36:21,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:36:21,550 INFO L87 Difference]: Start difference. First operand 377 states and 498 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:21,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:21,649 INFO L93 Difference]: Finished difference Result 669 states and 878 transitions. [2023-12-21 02:36:21,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:36:21,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-21 02:36:21,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:21,651 INFO L225 Difference]: With dead ends: 669 [2023-12-21 02:36:21,651 INFO L226 Difference]: Without dead ends: 350 [2023-12-21 02:36:21,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:36:21,653 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 19 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:21,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 547 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:36:21,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2023-12-21 02:36:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2023-12-21 02:36:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 301 states have (on average 1.2259136212624584) internal successors, (369), 301 states have internal predecessors, (369), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 461 transitions. [2023-12-21 02:36:21,669 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 461 transitions. Word has length 175 [2023-12-21 02:36:21,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:21,669 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 461 transitions. [2023-12-21 02:36:21,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 461 transitions. [2023-12-21 02:36:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-21 02:36:21,671 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:21,671 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:21,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-21 02:36:21,671 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:21,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:21,671 INFO L85 PathProgramCache]: Analyzing trace with hash 795574438, now seen corresponding path program 1 times [2023-12-21 02:36:21,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:21,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151808368] [2023-12-21 02:36:21,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:21,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:21,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:22,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:22,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151808368] [2023-12-21 02:36:22,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151808368] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:22,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:22,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 02:36:22,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966162150] [2023-12-21 02:36:22,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:22,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:36:22,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:36:22,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:36:22,011 INFO L87 Difference]: Start difference. First operand 350 states and 461 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-21 02:36:22,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:22,276 INFO L93 Difference]: Finished difference Result 677 states and 884 transitions. [2023-12-21 02:36:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:36:22,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2023-12-21 02:36:22,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:22,278 INFO L225 Difference]: With dead ends: 677 [2023-12-21 02:36:22,278 INFO L226 Difference]: Without dead ends: 385 [2023-12-21 02:36:22,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-21 02:36:22,279 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 265 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:22,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 397 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:36:22,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-12-21 02:36:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 352. [2023-12-21 02:36:22,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 303 states have (on average 1.221122112211221) internal successors, (370), 303 states have internal predecessors, (370), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 462 transitions. [2023-12-21 02:36:22,303 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 462 transitions. Word has length 175 [2023-12-21 02:36:22,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:22,303 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 462 transitions. [2023-12-21 02:36:22,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-21 02:36:22,303 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 462 transitions. [2023-12-21 02:36:22,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-21 02:36:22,304 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:22,304 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:22,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-21 02:36:22,305 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:22,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:22,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1053739876, now seen corresponding path program 1 times [2023-12-21 02:36:22,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:22,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248461072] [2023-12-21 02:36:22,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:22,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:22,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:22,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248461072] [2023-12-21 02:36:22,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248461072] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:22,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:22,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:36:22,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857780278] [2023-12-21 02:36:22,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:22,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:36:22,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:22,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:36:22,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:36:22,497 INFO L87 Difference]: Start difference. First operand 352 states and 462 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:22,651 INFO L93 Difference]: Finished difference Result 713 states and 926 transitions. [2023-12-21 02:36:22,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:36:22,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-21 02:36:22,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:22,653 INFO L225 Difference]: With dead ends: 713 [2023-12-21 02:36:22,653 INFO L226 Difference]: Without dead ends: 419 [2023-12-21 02:36:22,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:36:22,654 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 114 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:22,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 563 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:36:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-21 02:36:22,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 352. [2023-12-21 02:36:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 303 states have (on average 1.2178217821782178) internal successors, (369), 303 states have internal predecessors, (369), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 461 transitions. [2023-12-21 02:36:22,677 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 461 transitions. Word has length 175 [2023-12-21 02:36:22,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:22,678 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 461 transitions. [2023-12-21 02:36:22,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 461 transitions. [2023-12-21 02:36:22,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-21 02:36:22,679 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:22,679 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:22,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-21 02:36:22,679 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:22,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:22,680 INFO L85 PathProgramCache]: Analyzing trace with hash 660712866, now seen corresponding path program 1 times [2023-12-21 02:36:22,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:22,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015860353] [2023-12-21 02:36:22,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:22,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:24,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:24,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015860353] [2023-12-21 02:36:24,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015860353] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:24,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:24,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-21 02:36:24,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992229635] [2023-12-21 02:36:24,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:24,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-21 02:36:24,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:24,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-21 02:36:24,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-12-21 02:36:24,398 INFO L87 Difference]: Start difference. First operand 352 states and 461 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2023-12-21 02:36:25,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:25,507 INFO L93 Difference]: Finished difference Result 689 states and 896 transitions. [2023-12-21 02:36:25,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 02:36:25,507 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) Word has length 175 [2023-12-21 02:36:25,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:25,509 INFO L225 Difference]: With dead ends: 689 [2023-12-21 02:36:25,509 INFO L226 Difference]: Without dead ends: 395 [2023-12-21 02:36:25,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2023-12-21 02:36:25,510 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 356 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:25,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1044 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 02:36:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2023-12-21 02:36:25,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 354. [2023-12-21 02:36:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 305 states have (on average 1.2163934426229508) internal successors, (371), 305 states have internal predecessors, (371), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 463 transitions. [2023-12-21 02:36:25,532 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 463 transitions. Word has length 175 [2023-12-21 02:36:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:25,532 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 463 transitions. [2023-12-21 02:36:25,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2023-12-21 02:36:25,533 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 463 transitions. [2023-12-21 02:36:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-21 02:36:25,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:25,534 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:25,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-21 02:36:25,534 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:25,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:25,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1472294428, now seen corresponding path program 1 times [2023-12-21 02:36:25,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:25,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610854594] [2023-12-21 02:36:25,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:25,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:25,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:25,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:25,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:25,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:26,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:26,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610854594] [2023-12-21 02:36:26,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610854594] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:26,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:26,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 02:36:26,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510826007] [2023-12-21 02:36:26,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:26,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:36:26,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:26,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:36:26,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:36:26,042 INFO L87 Difference]: Start difference. First operand 354 states and 463 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:26,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:26,317 INFO L93 Difference]: Finished difference Result 571 states and 731 transitions. [2023-12-21 02:36:26,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 02:36:26,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-21 02:36:26,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:26,320 INFO L225 Difference]: With dead ends: 571 [2023-12-21 02:36:26,320 INFO L226 Difference]: Without dead ends: 569 [2023-12-21 02:36:26,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-21 02:36:26,320 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 285 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:26,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 563 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:36:26,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2023-12-21 02:36:26,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 558. [2023-12-21 02:36:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 509 states have (on average 1.223968565815324) internal successors, (623), 509 states have internal predecessors, (623), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:26,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 715 transitions. [2023-12-21 02:36:26,345 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 715 transitions. Word has length 175 [2023-12-21 02:36:26,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:26,346 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 715 transitions. [2023-12-21 02:36:26,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:26,346 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 715 transitions. [2023-12-21 02:36:26,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-21 02:36:26,347 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:26,347 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:26,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-21 02:36:26,347 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:26,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:26,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1494926682, now seen corresponding path program 1 times [2023-12-21 02:36:26,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:26,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508325088] [2023-12-21 02:36:26,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:26,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:26,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:26,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508325088] [2023-12-21 02:36:26,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508325088] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:26,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:26,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:36:26,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560898732] [2023-12-21 02:36:26,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:26,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:36:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:26,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:36:26,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:36:26,933 INFO L87 Difference]: Start difference. First operand 558 states and 715 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-21 02:36:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:27,050 INFO L93 Difference]: Finished difference Result 1078 states and 1372 transitions. [2023-12-21 02:36:27,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:36:27,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2023-12-21 02:36:27,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:27,053 INFO L225 Difference]: With dead ends: 1078 [2023-12-21 02:36:27,053 INFO L226 Difference]: Without dead ends: 578 [2023-12-21 02:36:27,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:36:27,055 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 63 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:27,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 366 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:36:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2023-12-21 02:36:27,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 563. [2023-12-21 02:36:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 514 states have (on average 1.2256809338521402) internal successors, (630), 514 states have internal predecessors, (630), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 722 transitions. [2023-12-21 02:36:27,081 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 722 transitions. Word has length 175 [2023-12-21 02:36:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:27,081 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 722 transitions. [2023-12-21 02:36:27,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-21 02:36:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 722 transitions. [2023-12-21 02:36:27,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-21 02:36:27,082 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:27,083 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:27,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-21 02:36:27,083 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:27,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:27,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1311023621, now seen corresponding path program 1 times [2023-12-21 02:36:27,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:27,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69773999] [2023-12-21 02:36:27,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:27,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:27,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:27,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69773999] [2023-12-21 02:36:27,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69773999] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:27,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:27,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-21 02:36:27,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249664968] [2023-12-21 02:36:27,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:27,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 02:36:27,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:27,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 02:36:27,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-12-21 02:36:27,583 INFO L87 Difference]: Start difference. First operand 563 states and 722 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:27,999 INFO L93 Difference]: Finished difference Result 1184 states and 1511 transitions. [2023-12-21 02:36:28,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 02:36:28,002 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2023-12-21 02:36:28,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:28,004 INFO L225 Difference]: With dead ends: 1184 [2023-12-21 02:36:28,004 INFO L226 Difference]: Without dead ends: 684 [2023-12-21 02:36:28,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2023-12-21 02:36:28,005 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 406 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:28,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1002 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:36:28,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2023-12-21 02:36:28,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 582. [2023-12-21 02:36:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 533 states have (on average 1.2307692307692308) internal successors, (656), 533 states have internal predecessors, (656), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:28,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 748 transitions. [2023-12-21 02:36:28,032 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 748 transitions. Word has length 176 [2023-12-21 02:36:28,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:28,032 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 748 transitions. [2023-12-21 02:36:28,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 748 transitions. [2023-12-21 02:36:28,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-21 02:36:28,033 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:28,033 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:28,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-21 02:36:28,034 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:28,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:28,034 INFO L85 PathProgramCache]: Analyzing trace with hash 165044799, now seen corresponding path program 1 times [2023-12-21 02:36:28,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:28,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969154934] [2023-12-21 02:36:28,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:28,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:28,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:28,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969154934] [2023-12-21 02:36:28,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969154934] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:28,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:28,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 02:36:28,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897285977] [2023-12-21 02:36:28,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:28,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:36:28,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:28,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:36:28,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:36:28,522 INFO L87 Difference]: Start difference. First operand 582 states and 748 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-21 02:36:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:28,843 INFO L93 Difference]: Finished difference Result 1226 states and 1566 transitions. [2023-12-21 02:36:28,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:36:28,844 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 176 [2023-12-21 02:36:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:28,846 INFO L225 Difference]: With dead ends: 1226 [2023-12-21 02:36:28,846 INFO L226 Difference]: Without dead ends: 707 [2023-12-21 02:36:28,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-21 02:36:28,847 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 287 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:28,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 429 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:36:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2023-12-21 02:36:28,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 597. [2023-12-21 02:36:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 548 states have (on average 1.2335766423357664) internal successors, (676), 548 states have internal predecessors, (676), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 768 transitions. [2023-12-21 02:36:28,878 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 768 transitions. Word has length 176 [2023-12-21 02:36:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:28,878 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 768 transitions. [2023-12-21 02:36:28,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-21 02:36:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 768 transitions. [2023-12-21 02:36:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-21 02:36:28,879 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:28,879 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:28,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-21 02:36:28,879 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:28,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:28,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2088272833, now seen corresponding path program 1 times [2023-12-21 02:36:28,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:28,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172351915] [2023-12-21 02:36:28,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:28,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:29,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:29,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172351915] [2023-12-21 02:36:29,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172351915] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:29,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:29,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 02:36:29,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4848832] [2023-12-21 02:36:29,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:29,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:36:29,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:29,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:36:29,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:36:29,377 INFO L87 Difference]: Start difference. First operand 597 states and 768 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:29,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:29,703 INFO L93 Difference]: Finished difference Result 1263 states and 1615 transitions. [2023-12-21 02:36:29,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:36:29,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2023-12-21 02:36:29,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:29,708 INFO L225 Difference]: With dead ends: 1263 [2023-12-21 02:36:29,708 INFO L226 Difference]: Without dead ends: 729 [2023-12-21 02:36:29,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:36:29,709 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 214 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:29,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 532 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:36:29,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2023-12-21 02:36:29,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 597. [2023-12-21 02:36:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 548 states have (on average 1.2335766423357664) internal successors, (676), 548 states have internal predecessors, (676), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 768 transitions. [2023-12-21 02:36:29,737 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 768 transitions. Word has length 176 [2023-12-21 02:36:29,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:29,738 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 768 transitions. [2023-12-21 02:36:29,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 768 transitions. [2023-12-21 02:36:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-21 02:36:29,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:29,739 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:29,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-21 02:36:29,739 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:29,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:29,739 INFO L85 PathProgramCache]: Analyzing trace with hash 466036363, now seen corresponding path program 1 times [2023-12-21 02:36:29,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:29,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444717690] [2023-12-21 02:36:29,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:29,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:30,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:30,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444717690] [2023-12-21 02:36:30,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444717690] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:30,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:30,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 02:36:30,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709540517] [2023-12-21 02:36:30,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:30,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:36:30,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:30,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:36:30,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:36:30,194 INFO L87 Difference]: Start difference. First operand 597 states and 768 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:30,443 INFO L93 Difference]: Finished difference Result 1181 states and 1508 transitions. [2023-12-21 02:36:30,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:36:30,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2023-12-21 02:36:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:30,446 INFO L225 Difference]: With dead ends: 1181 [2023-12-21 02:36:30,446 INFO L226 Difference]: Without dead ends: 647 [2023-12-21 02:36:30,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:36:30,447 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 191 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:30,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 450 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:36:30,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2023-12-21 02:36:30,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 582. [2023-12-21 02:36:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 533 states have (on average 1.2307692307692308) internal successors, (656), 533 states have internal predecessors, (656), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 748 transitions. [2023-12-21 02:36:30,474 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 748 transitions. Word has length 176 [2023-12-21 02:36:30,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:30,475 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 748 transitions. [2023-12-21 02:36:30,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 748 transitions. [2023-12-21 02:36:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-21 02:36:30,476 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:30,476 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:30,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-21 02:36:30,476 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:30,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:30,476 INFO L85 PathProgramCache]: Analyzing trace with hash 724201801, now seen corresponding path program 1 times [2023-12-21 02:36:30,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:30,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666454449] [2023-12-21 02:36:30,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:30,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:30,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:30,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666454449] [2023-12-21 02:36:30,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666454449] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:30,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:30,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 02:36:30,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843920581] [2023-12-21 02:36:30,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:30,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:36:30,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:30,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:36:30,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:36:30,899 INFO L87 Difference]: Start difference. First operand 582 states and 748 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:31,190 INFO L93 Difference]: Finished difference Result 1185 states and 1512 transitions. [2023-12-21 02:36:31,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:36:31,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2023-12-21 02:36:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:31,192 INFO L225 Difference]: With dead ends: 1185 [2023-12-21 02:36:31,192 INFO L226 Difference]: Without dead ends: 666 [2023-12-21 02:36:31,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:36:31,194 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 189 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:31,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 438 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:36:31,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2023-12-21 02:36:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 565. [2023-12-21 02:36:31,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 516 states have (on average 1.2306201550387597) internal successors, (635), 516 states have internal predecessors, (635), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 727 transitions. [2023-12-21 02:36:31,220 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 727 transitions. Word has length 176 [2023-12-21 02:36:31,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:31,220 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 727 transitions. [2023-12-21 02:36:31,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:31,220 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 727 transitions. [2023-12-21 02:36:31,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-21 02:36:31,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:31,221 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:31,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-21 02:36:31,221 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:31,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:31,222 INFO L85 PathProgramCache]: Analyzing trace with hash -679942459, now seen corresponding path program 1 times [2023-12-21 02:36:31,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:31,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105720746] [2023-12-21 02:36:31,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:32,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:32,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:32,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105720746] [2023-12-21 02:36:32,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105720746] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:32,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:32,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 02:36:32,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425491427] [2023-12-21 02:36:32,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:32,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 02:36:32,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:32,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 02:36:32,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-21 02:36:32,164 INFO L87 Difference]: Start difference. First operand 565 states and 727 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:33,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:33,078 INFO L93 Difference]: Finished difference Result 1143 states and 1463 transitions. [2023-12-21 02:36:33,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 02:36:33,078 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2023-12-21 02:36:33,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:33,080 INFO L225 Difference]: With dead ends: 1143 [2023-12-21 02:36:33,080 INFO L226 Difference]: Without dead ends: 641 [2023-12-21 02:36:33,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-12-21 02:36:33,081 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 257 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:33,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1101 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 02:36:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2023-12-21 02:36:33,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 546. [2023-12-21 02:36:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 497 states have (on average 1.2354124748490947) internal successors, (614), 497 states have internal predecessors, (614), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 706 transitions. [2023-12-21 02:36:33,107 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 706 transitions. Word has length 176 [2023-12-21 02:36:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:33,108 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 706 transitions. [2023-12-21 02:36:33,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:33,108 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 706 transitions. [2023-12-21 02:36:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-21 02:36:33,108 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:33,109 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:33,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-21 02:36:33,109 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:33,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:33,109 INFO L85 PathProgramCache]: Analyzing trace with hash 121802831, now seen corresponding path program 1 times [2023-12-21 02:36:33,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:33,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749389303] [2023-12-21 02:36:33,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:33,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:36:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:36:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:36:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:36:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:36:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:36:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:36:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:36:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:36:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:36:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:36:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 02:36:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:36:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 02:36:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 02:36:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-21 02:36:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-21 02:36:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-21 02:36:33,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:33,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749389303] [2023-12-21 02:36:33,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749389303] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:33,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:33,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:36:33,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232585099] [2023-12-21 02:36:33,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:33,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:36:33,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:33,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:36:33,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:36:33,202 INFO L87 Difference]: Start difference. First operand 546 states and 706 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:33,315 INFO L93 Difference]: Finished difference Result 1120 states and 1426 transitions. [2023-12-21 02:36:33,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:36:33,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2023-12-21 02:36:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:33,317 INFO L225 Difference]: With dead ends: 1120 [2023-12-21 02:36:33,317 INFO L226 Difference]: Without dead ends: 637 [2023-12-21 02:36:33,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:36:33,318 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 52 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:33,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 494 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:36:33,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2023-12-21 02:36:33,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 610. [2023-12-21 02:36:33,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 561 states have (on average 1.2192513368983957) internal successors, (684), 561 states have internal predecessors, (684), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 02:36:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 776 transitions. [2023-12-21 02:36:33,345 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 776 transitions. Word has length 177 [2023-12-21 02:36:33,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:33,345 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 776 transitions. [2023-12-21 02:36:33,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-21 02:36:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 776 transitions. [2023-12-21 02:36:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-21 02:36:33,346 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:33,346 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:33,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-21 02:36:33,346 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:33,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:33,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1745010886, now seen corresponding path program 1 times [2023-12-21 02:36:33,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:33,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375200258] [2023-12-21 02:36:33,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:33,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:36:33,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 02:36:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:36:33,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 02:36:33,532 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 02:36:33,533 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:36:33,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-21 02:36:33,537 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:36:33,540 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:36:33,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:36:33 BoogieIcfgContainer [2023-12-21 02:36:33,671 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:36:33,671 INFO L158 Benchmark]: Toolchain (without parser) took 26367.82ms. Allocated memory was 207.6MB in the beginning and 795.9MB in the end (delta: 588.3MB). Free memory was 167.8MB in the beginning and 402.8MB in the end (delta: -235.0MB). Peak memory consumption was 353.7MB. Max. memory is 8.0GB. [2023-12-21 02:36:33,671 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 207.6MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:36:33,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.90ms. Allocated memory is still 207.6MB. Free memory was 167.5MB in the beginning and 151.6MB in the end (delta: 15.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-21 02:36:33,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.59ms. Allocated memory is still 207.6MB. Free memory was 151.6MB in the beginning and 147.7MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:36:33,671 INFO L158 Benchmark]: Boogie Preprocessor took 80.02ms. Allocated memory is still 207.6MB. Free memory was 147.7MB in the beginning and 143.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:36:33,671 INFO L158 Benchmark]: RCFGBuilder took 633.71ms. Allocated memory was 207.6MB in the beginning and 294.6MB in the end (delta: 87.0MB). Free memory was 143.5MB in the beginning and 253.0MB in the end (delta: -109.5MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-12-21 02:36:33,672 INFO L158 Benchmark]: TraceAbstraction took 25381.34ms. Allocated memory was 294.6MB in the beginning and 795.9MB in the end (delta: 501.2MB). Free memory was 252.5MB in the beginning and 402.8MB in the end (delta: -150.4MB). Peak memory consumption was 351.9MB. Max. memory is 8.0GB. [2023-12-21 02:36:33,672 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.10ms. Allocated memory is still 207.6MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.90ms. Allocated memory is still 207.6MB. Free memory was 167.5MB in the beginning and 151.6MB in the end (delta: 15.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.59ms. Allocated memory is still 207.6MB. Free memory was 151.6MB in the beginning and 147.7MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 80.02ms. Allocated memory is still 207.6MB. Free memory was 147.7MB in the beginning and 143.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 633.71ms. Allocated memory was 207.6MB in the beginning and 294.6MB in the end (delta: 87.0MB). Free memory was 143.5MB in the beginning and 253.0MB in the end (delta: -109.5MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 25381.34ms. Allocated memory was 294.6MB in the beginning and 795.9MB in the end (delta: 501.2MB). Free memory was 252.5MB in the beginning and 402.8MB in the end (delta: -150.4MB). Peak memory consumption was 351.9MB. 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 143. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L59] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L60] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L61] unsigned char* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L62] double* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L63] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L64] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L65] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L66] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L67] signed char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L68] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L69] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L70] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L71] signed char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L72] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L73] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L74] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L75] unsigned char last_1_WrapperStruct00_var_1_5 = 0; [L147] isInitial = 1 [L148] FCALL initially() [L149] COND TRUE 1 [L150] CALL updateLastVariables() [L140] EXPR WrapperStruct00.var_1_5 [L140] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L150] RET updateLastVariables() [L151] CALL updateVariables() [L103] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L110] EXPR WrapperStruct00.var_1_4 [L110] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_4 [L110] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L111] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L113] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L114] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L116] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L117] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L119] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L120] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L121] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L122] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L123] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L124] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L125] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L126] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L127] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L128] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L129] WrapperStruct00.var_1_14 = __VERIFIER_nondet_char() [L130] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L131] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L132] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L133] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L133] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L133] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L134] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L134] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L134] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L135] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L136] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L136] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L136] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L137] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L137] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L137] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L151] RET updateVariables() [L152] CALL step() [L79] COND FALSE !(\read(last_1_WrapperStruct00_var_1_5)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L84] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L84] COND FALSE !((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) [L87] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L87] (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L87] (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L87] COND TRUE (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) [L88] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L88] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] (*(WrapperStruct00_var_1_5_Pointer)) = (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))) [L92] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L92] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] signed long int stepLocal_1 = ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1))); [L93] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L93] signed char stepLocal_0 = (*(WrapperStruct00_var_1_17_Pointer)); [L94] COND FALSE !(-10 >= stepLocal_0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L152] RET step() [L153] CALL, EXPR property() [L143] EXPR last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1 [L143] EXPR last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer)))))))) [L143] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L143] EXPR (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))) [L143] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L143] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) [L143] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1 [L143] EXPR (-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) [L143] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1 [L143] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L143] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143-L144] return (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) ; [L153] RET, EXPR property() [L153] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_5=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.2s, OverallIterations: 37, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5854 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5852 mSDsluCounter, 20590 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14815 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9485 IncrementalHoareTripleChecker+Invalid, 9729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 5775 mSDtfsCounter, 9485 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2054 GetRequests, 1768 SyntacticMatches, 6 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=610occurred in iteration=36, InterpolantAutomatonStates: 261, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 1728 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 6414 NumberOfCodeBlocks, 6414 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6199 ConstructedInterpolants, 0 QuantifiedInterpolants, 27686 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 36432/36432 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-21 02:36:33,695 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...