/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-96.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:35:17,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:35:17,701 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-16 04:35:17,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:35:17,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:35:17,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:35:17,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:35:17,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:35:17,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:35:17,734 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:35:17,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:35:17,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:35:17,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:35:17,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:35:17,735 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:35:17,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:35:17,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:35:17,752 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:35:17,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:35:17,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:35:17,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:35:17,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:35:17,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:35:17,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:35:17,754 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:35:17,754 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:35:17,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:35:17,755 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:35:17,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:35:17,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:35:17,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:35:17,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:35:17,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:35:17,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:35:17,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:35:17,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:35:17,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:35:17,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:35:17,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:35:17,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:35:17,757 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:35:17,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:35:17,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:35:17,758 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-16 04:35:17,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:35:17,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:35:17,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:35:17,960 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:35:17,960 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:35:17,961 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-96.i [2023-12-16 04:35:18,994 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:35:19,129 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:35:19,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i [2023-12-16 04:35:19,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1520c93/d73673cb0a7b4b39a9eaa2dd2ff565f2/FLAG7a49701a6 [2023-12-16 04:35:19,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1520c93/d73673cb0a7b4b39a9eaa2dd2ff565f2 [2023-12-16 04:35:19,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:35:19,550 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:35:19,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:35:19,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:35:19,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:35:19,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:35:19" (1/1) ... [2023-12-16 04:35:19,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ed3dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:19, skipping insertion in model container [2023-12-16 04:35:19,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:35:19" (1/1) ... [2023-12-16 04:35:19,572 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:35:19,668 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-96.i[917,930] [2023-12-16 04:35:19,707 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:35:19,715 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:35:19,723 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-96.i[917,930] [2023-12-16 04:35:19,746 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:35:19,760 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:35:19,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:19 WrapperNode [2023-12-16 04:35:19,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:35:19,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:35:19,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:35:19,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:35:19,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:19" (1/1) ... [2023-12-16 04:35:19,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:19" (1/1) ... [2023-12-16 04:35:19,803 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2023-12-16 04:35:19,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:35:19,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:35:19,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:35:19,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:35:19,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:19" (1/1) ... [2023-12-16 04:35:19,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:19" (1/1) ... [2023-12-16 04:35:19,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:19" (1/1) ... [2023-12-16 04:35:19,829 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 18 writes are split as follows [0, 18]. [2023-12-16 04:35:19,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:19" (1/1) ... [2023-12-16 04:35:19,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:19" (1/1) ... [2023-12-16 04:35:19,839 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:19" (1/1) ... [2023-12-16 04:35:19,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:19" (1/1) ... [2023-12-16 04:35:19,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:19" (1/1) ... [2023-12-16 04:35:19,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:19" (1/1) ... [2023-12-16 04:35:19,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:35:19,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:35:19,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:35:19,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:35:19,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:19" (1/1) ... [2023-12-16 04:35:19,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:35:19,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:35:19,891 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-16 04:35:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:35:19,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:35:19,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:35:19,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:35:19,909 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-16 04:35:19,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:35:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:35:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:35:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:35:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:35:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:35:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:35:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:35:19,918 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:35:19,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:35:19,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:35:19,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:35:19,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:35:19,999 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:35:20,001 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:35:20,327 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:35:20,360 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:35:20,360 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:35:20,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:35:20 BoogieIcfgContainer [2023-12-16 04:35:20,360 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:35:20,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:35:20,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:35:20,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:35:20,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:35:19" (1/3) ... [2023-12-16 04:35:20,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b21060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:35:20, skipping insertion in model container [2023-12-16 04:35:20,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:19" (2/3) ... [2023-12-16 04:35:20,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b21060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:35:20, skipping insertion in model container [2023-12-16 04:35:20,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:35:20" (3/3) ... [2023-12-16 04:35:20,366 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-96.i [2023-12-16 04:35:20,378 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:35:20,379 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:35:20,421 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:35:20,428 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;@7ae36f00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:35:20,428 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:35:20,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:35:20,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 04:35:20,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:20,446 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:20,446 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:20,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:20,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1451165356, now seen corresponding path program 1 times [2023-12-16 04:35:20,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:20,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468422925] [2023-12-16 04:35:20,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:20,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:20,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:20,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:20,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:20,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:20,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:20,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:20,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:20,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:20,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:20,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:20,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:20,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:20,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:20,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:20,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:20,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:20,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:20,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468422925] [2023-12-16 04:35:20,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468422925] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:20,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:20,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:35:20,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538220673] [2023-12-16 04:35:20,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:20,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:35:20,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:20,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:35:20,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:35:20,869 INFO L87 Difference]: Start difference. First operand has 101 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:35:20,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:20,897 INFO L93 Difference]: Finished difference Result 199 states and 318 transitions. [2023-12-16 04:35:20,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:35:20,899 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2023-12-16 04:35:20,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:20,904 INFO L225 Difference]: With dead ends: 199 [2023-12-16 04:35:20,904 INFO L226 Difference]: Without dead ends: 99 [2023-12-16 04:35:20,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-16 04:35:20,909 INFO L413 NwaCegarLoop]: 143 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, 143 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-16 04:35:20,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:35:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-16 04:35:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-12-16 04:35:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:35:20,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 147 transitions. [2023-12-16 04:35:20,940 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 147 transitions. Word has length 126 [2023-12-16 04:35:20,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:20,940 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 147 transitions. [2023-12-16 04:35:20,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:35:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 147 transitions. [2023-12-16 04:35:20,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 04:35:20,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:20,945 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:20,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:35:20,945 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:20,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:20,946 INFO L85 PathProgramCache]: Analyzing trace with hash 493141240, now seen corresponding path program 1 times [2023-12-16 04:35:20,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:20,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506069565] [2023-12-16 04:35:20,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:20,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,153 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:21,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:21,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506069565] [2023-12-16 04:35:21,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506069565] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:21,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:21,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:35:21,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101546977] [2023-12-16 04:35:21,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:21,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:35:21,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:21,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:35:21,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:35:21,156 INFO L87 Difference]: Start difference. First operand 99 states and 147 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:21,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:21,196 INFO L93 Difference]: Finished difference Result 209 states and 310 transitions. [2023-12-16 04:35:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:35:21,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2023-12-16 04:35:21,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:21,198 INFO L225 Difference]: With dead ends: 209 [2023-12-16 04:35:21,198 INFO L226 Difference]: Without dead ends: 111 [2023-12-16 04:35:21,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-16 04:35:21,200 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 21 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:21,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 420 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:35:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-16 04:35:21,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 101. [2023-12-16 04:35:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 83 states have internal predecessors, (117), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:35:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 149 transitions. [2023-12-16 04:35:21,209 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 149 transitions. Word has length 126 [2023-12-16 04:35:21,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:21,210 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 149 transitions. [2023-12-16 04:35:21,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:21,210 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 149 transitions. [2023-12-16 04:35:21,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 04:35:21,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:21,211 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:21,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:35:21,212 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:21,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:21,212 INFO L85 PathProgramCache]: Analyzing trace with hash -316205386, now seen corresponding path program 1 times [2023-12-16 04:35:21,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:21,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854534954] [2023-12-16 04:35:21,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:21,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:21,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:21,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854534954] [2023-12-16 04:35:21,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854534954] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:21,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:21,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:35:21,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314902700] [2023-12-16 04:35:21,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:21,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:35:21,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:21,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:35:21,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:35:21,373 INFO L87 Difference]: Start difference. First operand 101 states and 149 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:21,419 INFO L93 Difference]: Finished difference Result 209 states and 308 transitions. [2023-12-16 04:35:21,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:35:21,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2023-12-16 04:35:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:21,425 INFO L225 Difference]: With dead ends: 209 [2023-12-16 04:35:21,426 INFO L226 Difference]: Without dead ends: 109 [2023-12-16 04:35:21,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-16 04:35:21,427 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 12 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 418 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-16 04:35:21,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 418 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:35:21,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-16 04:35:21,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2023-12-16 04:35:21,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.4) internal successors, (119), 85 states have internal predecessors, (119), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:35:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2023-12-16 04:35:21,434 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 126 [2023-12-16 04:35:21,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:21,435 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2023-12-16 04:35:21,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:21,435 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2023-12-16 04:35:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 04:35:21,436 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:21,436 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:21,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:35:21,436 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:21,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:21,437 INFO L85 PathProgramCache]: Analyzing trace with hash -258947084, now seen corresponding path program 1 times [2023-12-16 04:35:21,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:21,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848855682] [2023-12-16 04:35:21,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:21,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,619 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:21,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:21,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848855682] [2023-12-16 04:35:21,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848855682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:21,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:21,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:35:21,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903282702] [2023-12-16 04:35:21,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:21,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:35:21,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:21,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:35:21,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:35:21,622 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:21,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:21,659 INFO L93 Difference]: Finished difference Result 209 states and 306 transitions. [2023-12-16 04:35:21,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:35:21,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2023-12-16 04:35:21,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:21,663 INFO L225 Difference]: With dead ends: 209 [2023-12-16 04:35:21,664 INFO L226 Difference]: Without dead ends: 107 [2023-12-16 04:35:21,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-16 04:35:21,674 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 3 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:21,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 418 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:35:21,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-16 04:35:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2023-12-16 04:35:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 87 states have internal predecessors, (121), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:35:21,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2023-12-16 04:35:21,682 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 126 [2023-12-16 04:35:21,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:21,682 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2023-12-16 04:35:21,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:21,682 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2023-12-16 04:35:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 04:35:21,683 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:21,683 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:21,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:35:21,684 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:21,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:21,684 INFO L85 PathProgramCache]: Analyzing trace with hash -258887502, now seen corresponding path program 1 times [2023-12-16 04:35:21,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:21,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177323899] [2023-12-16 04:35:21,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:21,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:21,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:21,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177323899] [2023-12-16 04:35:21,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177323899] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:21,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:21,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:35:21,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142634741] [2023-12-16 04:35:21,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:21,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:35:21,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:21,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:35:21,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:35:21,920 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:22,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:22,034 INFO L93 Difference]: Finished difference Result 211 states and 308 transitions. [2023-12-16 04:35:22,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:35:22,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2023-12-16 04:35:22,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:22,036 INFO L225 Difference]: With dead ends: 211 [2023-12-16 04:35:22,036 INFO L226 Difference]: Without dead ends: 107 [2023-12-16 04:35:22,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 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-16 04:35:22,040 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 5 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:22,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 446 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:35:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-16 04:35:22,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-12-16 04:35:22,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 89 states have internal predecessors, (123), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:35:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2023-12-16 04:35:22,056 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 126 [2023-12-16 04:35:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:22,057 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2023-12-16 04:35:22,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2023-12-16 04:35:22,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 04:35:22,058 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:22,058 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:22,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:35:22,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:22,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:22,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2041935088, now seen corresponding path program 1 times [2023-12-16 04:35:22,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:22,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372631019] [2023-12-16 04:35:22,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:22,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,388 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:23,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:23,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372631019] [2023-12-16 04:35:23,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372631019] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:23,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:23,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:35:23,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779843320] [2023-12-16 04:35:23,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:23,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:35:23,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:23,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:35:23,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:35:23,390 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:35:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:23,878 INFO L93 Difference]: Finished difference Result 303 states and 438 transitions. [2023-12-16 04:35:23,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:35:23,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2023-12-16 04:35:23,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:23,880 INFO L225 Difference]: With dead ends: 303 [2023-12-16 04:35:23,880 INFO L226 Difference]: Without dead ends: 197 [2023-12-16 04:35:23,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:35:23,881 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 428 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:23,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 344 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:35:23,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-12-16 04:35:23,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 119. [2023-12-16 04:35:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:35:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2023-12-16 04:35:23,893 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 126 [2023-12-16 04:35:23,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:23,893 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2023-12-16 04:35:23,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:35:23,894 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2023-12-16 04:35:23,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-16 04:35:23,894 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:23,895 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:23,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:35:23,895 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:23,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:23,895 INFO L85 PathProgramCache]: Analyzing trace with hash 990182197, now seen corresponding path program 1 times [2023-12-16 04:35:23,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:23,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117953277] [2023-12-16 04:35:23,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:23,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:23,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:23,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117953277] [2023-12-16 04:35:23,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117953277] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:23,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:23,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:35:23,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194931083] [2023-12-16 04:35:23,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:23,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:35:23,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:23,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:35:23,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:35:23,966 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:23,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:23,992 INFO L93 Difference]: Finished difference Result 288 states and 417 transitions. [2023-12-16 04:35:23,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:35:23,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2023-12-16 04:35:23,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:23,993 INFO L225 Difference]: With dead ends: 288 [2023-12-16 04:35:23,993 INFO L226 Difference]: Without dead ends: 170 [2023-12-16 04:35:23,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-16 04:35:23,994 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 65 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:23,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 339 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:35:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-12-16 04:35:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 132. [2023-12-16 04:35:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 114 states have (on average 1.4035087719298245) internal successors, (160), 114 states have internal predecessors, (160), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:35:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 192 transitions. [2023-12-16 04:35:24,004 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 192 transitions. Word has length 128 [2023-12-16 04:35:24,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:24,005 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 192 transitions. [2023-12-16 04:35:24,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 192 transitions. [2023-12-16 04:35:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-16 04:35:24,006 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:24,006 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:24,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:35:24,006 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:24,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:24,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1380870586, now seen corresponding path program 1 times [2023-12-16 04:35:24,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:24,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042498748] [2023-12-16 04:35:24,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:24,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:24,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:24,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042498748] [2023-12-16 04:35:24,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042498748] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:24,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:24,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:35:24,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953248599] [2023-12-16 04:35:24,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:24,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:35:24,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:24,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:35:24,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:35:24,385 INFO L87 Difference]: Start difference. First operand 132 states and 192 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:35:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:24,460 INFO L93 Difference]: Finished difference Result 259 states and 379 transitions. [2023-12-16 04:35:24,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:35:24,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2023-12-16 04:35:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:24,462 INFO L225 Difference]: With dead ends: 259 [2023-12-16 04:35:24,462 INFO L226 Difference]: Without dead ends: 128 [2023-12-16 04:35:24,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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-16 04:35:24,463 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 111 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:24,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 216 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:35:24,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-16 04:35:24,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-12-16 04:35:24,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 110 states have (on average 1.3909090909090909) internal successors, (153), 110 states have internal predecessors, (153), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:35:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 185 transitions. [2023-12-16 04:35:24,477 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 185 transitions. Word has length 128 [2023-12-16 04:35:24,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:24,477 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 185 transitions. [2023-12-16 04:35:24,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:35:24,477 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 185 transitions. [2023-12-16 04:35:24,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-16 04:35:24,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:24,478 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:24,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:35:24,478 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:24,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:24,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1747219886, now seen corresponding path program 1 times [2023-12-16 04:35:24,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:24,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391198112] [2023-12-16 04:35:24,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:24,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:24,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:24,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391198112] [2023-12-16 04:35:24,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391198112] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:24,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:24,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:35:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685439531] [2023-12-16 04:35:24,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:24,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:35:24,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:24,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:35:24,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:35:24,606 INFO L87 Difference]: Start difference. First operand 128 states and 185 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:24,648 INFO L93 Difference]: Finished difference Result 276 states and 398 transitions. [2023-12-16 04:35:24,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:35:24,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2023-12-16 04:35:24,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:24,651 INFO L225 Difference]: With dead ends: 276 [2023-12-16 04:35:24,651 INFO L226 Difference]: Without dead ends: 149 [2023-12-16 04:35:24,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-16 04:35:24,651 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 79 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:24,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 536 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:35:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-16 04:35:24,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2023-12-16 04:35:24,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 113 states have internal predecessors, (156), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:35:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2023-12-16 04:35:24,662 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 128 [2023-12-16 04:35:24,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:24,663 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2023-12-16 04:35:24,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:24,663 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2023-12-16 04:35:24,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-16 04:35:24,664 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:24,664 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:24,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:35:24,664 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:24,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:24,664 INFO L85 PathProgramCache]: Analyzing trace with hash -721476681, now seen corresponding path program 1 times [2023-12-16 04:35:24,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:24,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214807066] [2023-12-16 04:35:24,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:24,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:24,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:24,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214807066] [2023-12-16 04:35:24,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214807066] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:24,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:24,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:35:24,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962694197] [2023-12-16 04:35:24,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:24,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:35:24,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:24,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:35:24,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:35:24,732 INFO L87 Difference]: Start difference. First operand 131 states and 188 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:24,756 INFO L93 Difference]: Finished difference Result 302 states and 430 transitions. [2023-12-16 04:35:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:35:24,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2023-12-16 04:35:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:24,758 INFO L225 Difference]: With dead ends: 302 [2023-12-16 04:35:24,758 INFO L226 Difference]: Without dead ends: 172 [2023-12-16 04:35:24,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-16 04:35:24,759 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 61 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:24,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 275 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:35:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-12-16 04:35:24,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 131. [2023-12-16 04:35:24,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:35:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 186 transitions. [2023-12-16 04:35:24,770 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 186 transitions. Word has length 128 [2023-12-16 04:35:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:24,770 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 186 transitions. [2023-12-16 04:35:24,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 186 transitions. [2023-12-16 04:35:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-16 04:35:24,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:24,771 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:24,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:35:24,771 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:24,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:24,772 INFO L85 PathProgramCache]: Analyzing trace with hash 563222136, now seen corresponding path program 1 times [2023-12-16 04:35:24,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:24,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992693817] [2023-12-16 04:35:24,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:24,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:24,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:24,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992693817] [2023-12-16 04:35:24,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992693817] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:24,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:24,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:35:24,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946861380] [2023-12-16 04:35:24,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:24,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:35:24,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:24,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:35:24,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:35:24,887 INFO L87 Difference]: Start difference. First operand 131 states and 186 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:24,953 INFO L93 Difference]: Finished difference Result 257 states and 363 transitions. [2023-12-16 04:35:24,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:35:24,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2023-12-16 04:35:24,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:24,954 INFO L225 Difference]: With dead ends: 257 [2023-12-16 04:35:24,954 INFO L226 Difference]: Without dead ends: 127 [2023-12-16 04:35:24,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-16 04:35:24,955 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:24,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 353 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:35:24,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-12-16 04:35:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-12-16 04:35:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 109 states have (on average 1.311926605504587) internal successors, (143), 109 states have internal predecessors, (143), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:35:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 175 transitions. [2023-12-16 04:35:24,965 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 175 transitions. Word has length 128 [2023-12-16 04:35:24,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:24,966 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 175 transitions. [2023-12-16 04:35:24,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:24,966 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 175 transitions. [2023-12-16 04:35:24,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-16 04:35:24,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:24,967 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:24,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:35:24,967 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:24,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:24,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1748760996, now seen corresponding path program 1 times [2023-12-16 04:35:24,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:24,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669604931] [2023-12-16 04:35:24,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:24,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:25,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:25,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669604931] [2023-12-16 04:35:25,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669604931] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:25,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:25,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:35:25,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210414314] [2023-12-16 04:35:25,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:25,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:35:25,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:25,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:35:25,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:35:25,167 INFO L87 Difference]: Start difference. First operand 127 states and 175 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:25,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:25,316 INFO L93 Difference]: Finished difference Result 258 states and 356 transitions. [2023-12-16 04:35:25,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:35:25,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2023-12-16 04:35:25,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:25,317 INFO L225 Difference]: With dead ends: 258 [2023-12-16 04:35:25,317 INFO L226 Difference]: Without dead ends: 132 [2023-12-16 04:35:25,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:35:25,318 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 17 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:25,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 501 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:35:25,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-12-16 04:35:25,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2023-12-16 04:35:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 109 states have (on average 1.2935779816513762) internal successors, (141), 109 states have internal predecessors, (141), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:35:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 173 transitions. [2023-12-16 04:35:25,328 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 173 transitions. Word has length 129 [2023-12-16 04:35:25,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:25,329 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 173 transitions. [2023-12-16 04:35:25,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:25,329 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 173 transitions. [2023-12-16 04:35:25,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-16 04:35:25,330 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:25,330 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:25,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 04:35:25,330 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:25,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:25,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2138690372, now seen corresponding path program 1 times [2023-12-16 04:35:25,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:25,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965339111] [2023-12-16 04:35:25,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:25,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,467 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:25,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:25,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965339111] [2023-12-16 04:35:25,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965339111] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:25,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:25,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:35:25,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103543270] [2023-12-16 04:35:25,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:25,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:35:25,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:25,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:35:25,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:35:25,469 INFO L87 Difference]: Start difference. First operand 127 states and 173 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:25,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:25,609 INFO L93 Difference]: Finished difference Result 363 states and 495 transitions. [2023-12-16 04:35:25,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:35:25,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2023-12-16 04:35:25,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:25,610 INFO L225 Difference]: With dead ends: 363 [2023-12-16 04:35:25,610 INFO L226 Difference]: Without dead ends: 237 [2023-12-16 04:35:25,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-16 04:35:25,611 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 103 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:25,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 322 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:35:25,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-12-16 04:35:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 175. [2023-12-16 04:35:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 140 states have (on average 1.2714285714285714) internal successors, (178), 140 states have internal predecessors, (178), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:35:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 242 transitions. [2023-12-16 04:35:25,632 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 242 transitions. Word has length 130 [2023-12-16 04:35:25,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:25,632 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 242 transitions. [2023-12-16 04:35:25,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 242 transitions. [2023-12-16 04:35:25,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-16 04:35:25,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:25,633 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:25,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 04:35:25,633 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:25,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1738949527, now seen corresponding path program 1 times [2023-12-16 04:35:25,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:25,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152071041] [2023-12-16 04:35:25,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:25,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:25,763 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:25,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:25,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152071041] [2023-12-16 04:35:25,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152071041] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:25,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:25,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:35:25,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426045914] [2023-12-16 04:35:25,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:25,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:35:25,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:25,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:35:25,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:35:25,765 INFO L87 Difference]: Start difference. First operand 175 states and 242 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:25,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:25,793 INFO L93 Difference]: Finished difference Result 301 states and 414 transitions. [2023-12-16 04:35:25,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:35:25,793 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-12-16 04:35:25,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:25,794 INFO L225 Difference]: With dead ends: 301 [2023-12-16 04:35:25,794 INFO L226 Difference]: Without dead ends: 175 [2023-12-16 04:35:25,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-16 04:35:25,795 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:25,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 264 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:35:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-16 04:35:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-12-16 04:35:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 140 states have (on average 1.2571428571428571) internal successors, (176), 140 states have internal predecessors, (176), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:35:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 240 transitions. [2023-12-16 04:35:25,814 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 240 transitions. Word has length 131 [2023-12-16 04:35:25,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:25,815 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 240 transitions. [2023-12-16 04:35:25,815 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:25,815 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 240 transitions. [2023-12-16 04:35:25,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-16 04:35:25,816 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:25,816 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:25,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 04:35:25,816 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:25,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:25,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1316247701, now seen corresponding path program 1 times [2023-12-16 04:35:25,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:25,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364016209] [2023-12-16 04:35:25,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:25,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:27,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:27,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364016209] [2023-12-16 04:35:27,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364016209] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:27,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:27,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:35:27,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137076702] [2023-12-16 04:35:27,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:27,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:35:27,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:27,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:35:27,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:35:27,350 INFO L87 Difference]: Start difference. First operand 175 states and 240 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:35:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:27,778 INFO L93 Difference]: Finished difference Result 342 states and 465 transitions. [2023-12-16 04:35:27,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:35:27,778 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2023-12-16 04:35:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:27,779 INFO L225 Difference]: With dead ends: 342 [2023-12-16 04:35:27,779 INFO L226 Difference]: Without dead ends: 216 [2023-12-16 04:35:27,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:35:27,781 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 360 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:27,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 332 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:35:27,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-12-16 04:35:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 169. [2023-12-16 04:35:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 134 states have (on average 1.2686567164179106) internal successors, (170), 134 states have internal predecessors, (170), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:35:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 234 transitions. [2023-12-16 04:35:27,806 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 234 transitions. Word has length 131 [2023-12-16 04:35:27,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:27,807 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 234 transitions. [2023-12-16 04:35:27,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:35:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 234 transitions. [2023-12-16 04:35:27,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-16 04:35:27,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:27,808 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:27,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 04:35:27,809 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:27,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:27,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1877554775, now seen corresponding path program 1 times [2023-12-16 04:35:27,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:27,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250702092] [2023-12-16 04:35:27,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:27,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:27,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:27,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250702092] [2023-12-16 04:35:27,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250702092] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:27,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:27,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:35:27,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486181216] [2023-12-16 04:35:27,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:27,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:35:27,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:27,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:35:27,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:35:27,921 INFO L87 Difference]: Start difference. First operand 169 states and 234 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:27,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:27,974 INFO L93 Difference]: Finished difference Result 377 states and 516 transitions. [2023-12-16 04:35:27,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:35:27,975 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-12-16 04:35:27,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:27,976 INFO L225 Difference]: With dead ends: 377 [2023-12-16 04:35:27,976 INFO L226 Difference]: Without dead ends: 257 [2023-12-16 04:35:27,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-16 04:35:27,977 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 113 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:27,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 431 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:35:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-12-16 04:35:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 172. [2023-12-16 04:35:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 137 states have (on average 1.2773722627737227) internal successors, (175), 137 states have internal predecessors, (175), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:35:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 239 transitions. [2023-12-16 04:35:28,005 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 239 transitions. Word has length 131 [2023-12-16 04:35:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:28,005 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 239 transitions. [2023-12-16 04:35:28,005 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 239 transitions. [2023-12-16 04:35:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-16 04:35:28,006 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:28,006 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:28,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 04:35:28,006 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:28,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:28,007 INFO L85 PathProgramCache]: Analyzing trace with hash 597691097, now seen corresponding path program 1 times [2023-12-16 04:35:28,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:28,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922617933] [2023-12-16 04:35:28,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:28,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:28,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:28,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922617933] [2023-12-16 04:35:28,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922617933] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:28,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:28,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:35:28,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702953257] [2023-12-16 04:35:28,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:28,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:35:28,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:28,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:35:28,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:35:28,133 INFO L87 Difference]: Start difference. First operand 172 states and 239 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:28,209 INFO L93 Difference]: Finished difference Result 335 states and 463 transitions. [2023-12-16 04:35:28,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:35:28,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-12-16 04:35:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:28,210 INFO L225 Difference]: With dead ends: 335 [2023-12-16 04:35:28,210 INFO L226 Difference]: Without dead ends: 212 [2023-12-16 04:35:28,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:35:28,212 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 104 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:28,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 651 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:35:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-12-16 04:35:28,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 173. [2023-12-16 04:35:28,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 138 states have (on average 1.2753623188405796) internal successors, (176), 138 states have internal predecessors, (176), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:35:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 240 transitions. [2023-12-16 04:35:28,240 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 240 transitions. Word has length 131 [2023-12-16 04:35:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:28,241 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 240 transitions. [2023-12-16 04:35:28,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 240 transitions. [2023-12-16 04:35:28,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-16 04:35:28,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:28,242 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:28,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 04:35:28,242 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:28,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:28,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2018640527, now seen corresponding path program 1 times [2023-12-16 04:35:28,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:28,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448947600] [2023-12-16 04:35:28,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:28,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:28,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:28,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448947600] [2023-12-16 04:35:28,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448947600] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:28,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:28,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:35:28,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100568951] [2023-12-16 04:35:28,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:28,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:35:28,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:28,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:35:28,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:35:28,389 INFO L87 Difference]: Start difference. First operand 173 states and 240 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:28,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:28,514 INFO L93 Difference]: Finished difference Result 302 states and 415 transitions. [2023-12-16 04:35:28,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:35:28,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2023-12-16 04:35:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:28,516 INFO L225 Difference]: With dead ends: 302 [2023-12-16 04:35:28,516 INFO L226 Difference]: Without dead ends: 178 [2023-12-16 04:35:28,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:35:28,517 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 71 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:28,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 387 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:35:28,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-12-16 04:35:28,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 173. [2023-12-16 04:35:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 138 states have (on average 1.2681159420289856) internal successors, (175), 138 states have internal predecessors, (175), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:35:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 239 transitions. [2023-12-16 04:35:28,540 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 239 transitions. Word has length 132 [2023-12-16 04:35:28,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:28,540 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 239 transitions. [2023-12-16 04:35:28,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:28,540 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 239 transitions. [2023-12-16 04:35:28,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-16 04:35:28,541 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:28,541 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:28,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 04:35:28,542 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:28,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:28,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1431834513, now seen corresponding path program 1 times [2023-12-16 04:35:28,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:28,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200022625] [2023-12-16 04:35:28,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:28,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:35:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:35:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:35:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:35:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:35:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:35:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:35:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:35:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:35:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:35:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:35:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:35:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:35:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:35:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:35:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:35:28,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:28,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200022625] [2023-12-16 04:35:28,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200022625] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:28,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:28,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:35:28,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948798936] [2023-12-16 04:35:28,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:28,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:35:28,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:28,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:35:28,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:35:28,800 INFO L87 Difference]: Start difference. First operand 173 states and 239 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:28,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:28,962 INFO L93 Difference]: Finished difference Result 178 states and 244 transitions. [2023-12-16 04:35:28,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:35:28,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2023-12-16 04:35:28,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:28,963 INFO L225 Difference]: With dead ends: 178 [2023-12-16 04:35:28,963 INFO L226 Difference]: Without dead ends: 176 [2023-12-16 04:35:28,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:35:28,964 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 135 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:28,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 352 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:35:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-12-16 04:35:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2023-12-16 04:35:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 140 states have (on average 1.2642857142857142) internal successors, (177), 140 states have internal predecessors, (177), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:35:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 241 transitions. [2023-12-16 04:35:28,986 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 241 transitions. Word has length 132 [2023-12-16 04:35:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:28,986 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 241 transitions. [2023-12-16 04:35:28,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:35:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 241 transitions. [2023-12-16 04:35:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-16 04:35:28,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:28,988 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:35:28,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-16 04:35:28,989 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:28,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1431894095, now seen corresponding path program 1 times [2023-12-16 04:35:28,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:28,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657710156] [2023-12-16 04:35:28,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:28,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:35:29,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:35:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:35:29,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:35:29,159 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:35:29,160 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:35:29,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 04:35:29,163 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] [2023-12-16 04:35:29,166 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:35:29,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:35:29 BoogieIcfgContainer [2023-12-16 04:35:29,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:35:29,274 INFO L158 Benchmark]: Toolchain (without parser) took 9724.55ms. Allocated memory was 234.9MB in the beginning and 427.8MB in the end (delta: 192.9MB). Free memory was 191.9MB in the beginning and 356.7MB in the end (delta: -164.8MB). Peak memory consumption was 248.2MB. Max. memory is 8.0GB. [2023-12-16 04:35:29,275 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 172.0MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:35:29,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.08ms. Allocated memory is still 234.9MB. Free memory was 191.9MB in the beginning and 176.0MB in the end (delta: 15.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 04:35:29,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.97ms. Allocated memory is still 234.9MB. Free memory was 176.0MB in the beginning and 172.0MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:35:29,275 INFO L158 Benchmark]: Boogie Preprocessor took 45.34ms. Allocated memory is still 234.9MB. Free memory was 172.0MB in the beginning and 167.1MB in the end (delta: 4.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:35:29,275 INFO L158 Benchmark]: RCFGBuilder took 511.09ms. Allocated memory is still 234.9MB. Free memory was 167.1MB in the beginning and 132.1MB in the end (delta: 35.0MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-12-16 04:35:29,278 INFO L158 Benchmark]: TraceAbstraction took 8911.95ms. Allocated memory was 234.9MB in the beginning and 427.8MB in the end (delta: 192.9MB). Free memory was 131.5MB in the beginning and 356.7MB in the end (delta: -225.2MB). Peak memory consumption was 187.3MB. Max. memory is 8.0GB. [2023-12-16 04:35:29,281 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 172.0MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.08ms. Allocated memory is still 234.9MB. Free memory was 191.9MB in the beginning and 176.0MB in the end (delta: 15.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.97ms. Allocated memory is still 234.9MB. Free memory was 176.0MB in the beginning and 172.0MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.34ms. Allocated memory is still 234.9MB. Free memory was 172.0MB in the beginning and 167.1MB in the end (delta: 4.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 511.09ms. Allocated memory is still 234.9MB. Free memory was 167.1MB in the beginning and 132.1MB in the end (delta: 35.0MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 8911.95ms. Allocated memory was 234.9MB in the beginning and 427.8MB in the end (delta: 192.9MB). Free memory was 131.5MB in the beginning and 356.7MB in the end (delta: -225.2MB). Peak memory consumption was 187.3MB. 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 124, overapproximation of someBinaryFLOATComparisonOperation at line 133. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L57] unsigned short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L58] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L59] unsigned short int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L60] unsigned short int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L61] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L62] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L63] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L64] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L65] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L66] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L67] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L68] signed long int* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L69] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L70] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L71] signed char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L72] unsigned char last_1_WrapperStruct00_var_1_5 = 1; [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L130] EXPR WrapperStruct00.var_1_5 [L130] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L140] RET updateLastVariables() [L141] 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:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L106] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L107] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L108] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L109] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L110] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L111] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L112] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L114] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L115] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L117] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L119] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L120] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L121] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L122] EXPR WrapperStruct00.var_1_13 [L122] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L122] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L122] EXPR WrapperStruct00.var_1_13 [L122] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L122] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L122] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L122] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L122] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L123] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L124] EXPR WrapperStruct00.var_1_14 [L124] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L124] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L124] EXPR WrapperStruct00.var_1_14 [L124] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L124] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L124] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L124] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L124] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L125] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L126] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L127] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L141] RET updateVariables() [L142] CALL step() [L76] COND FALSE !(! last_1_WrapperStruct00_var_1_5) [L79] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L79] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_4_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L81] unsigned char stepLocal_0 = (*(WrapperStruct00_var_1_6_Pointer)); [L82] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L82] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L91] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_1_Pointer)) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L92] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L93] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L93] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L94] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L94] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L94] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L94] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=1] [L94] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L94] COND FALSE !((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer)))) [L133] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L133] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L133] EXPR (! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1) [L133] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1 [L133] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1) [L133] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L133] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L133] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1 [L133] EXPR ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) [L133] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L133] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L133] EXPR ((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))) [L133] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L133] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L133] EXPR (((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133-L134] return ((((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer)))) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_5=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 20, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1690 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1690 mSDsluCounter, 7148 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4627 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1780 IncrementalHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 2521 mSDtfsCounter, 1780 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 751 GetRequests, 663 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=13, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 437 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2575 NumberOfCodeBlocks, 2575 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2424 ConstructedInterpolants, 0 QuantifiedInterpolants, 9220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 9120/9120 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-16 04:35:29,319 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...