/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-70.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 02:50:12,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 02:50:12,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 02:50:12,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 02:50:12,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 02:50:12,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 02:50:12,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 02:50:12,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 02:50:12,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 02:50:12,863 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 02:50:12,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 02:50:12,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 02:50:12,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 02:50:12,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 02:50:12,866 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 02:50:12,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 02:50:12,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 02:50:12,866 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 02:50:12,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 02:50:12,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 02:50:12,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 02:50:12,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 02:50:12,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 02:50:12,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 02:50:12,867 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 02:50:12,867 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 02:50:12,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 02:50:12,868 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 02:50:12,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 02:50:12,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 02:50:12,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 02:50:12,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 02:50:12,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:50:12,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 02:50:12,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 02:50:12,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 02:50:12,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 02:50:12,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 02:50:12,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 02:50:12,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 02:50:12,870 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 02:50:12,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 02:50:12,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 02:50:12,870 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 02:50:13,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 02:50:13,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 02:50:13,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 02:50:13,078 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 02:50:13,078 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 02:50:13,079 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-70.i [2023-12-21 02:50:14,084 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 02:50:14,223 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 02:50:14,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2023-12-21 02:50:14,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2426425e/e01b8c5c234845a5809ad92eb237bc34/FLAG535a1f99b [2023-12-21 02:50:14,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2426425e/e01b8c5c234845a5809ad92eb237bc34 [2023-12-21 02:50:14,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 02:50:14,243 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 02:50:14,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 02:50:14,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 02:50:14,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 02:50:14,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:50:14" (1/1) ... [2023-12-21 02:50:14,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cbee6aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:50:14, skipping insertion in model container [2023-12-21 02:50:14,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:50:14" (1/1) ... [2023-12-21 02:50:14,283 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 02:50:14,392 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-70.i[917,930] [2023-12-21 02:50:14,435 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:50:14,443 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 02:50:14,452 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-70.i[917,930] [2023-12-21 02:50:14,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:50:14,504 INFO L206 MainTranslator]: Completed translation [2023-12-21 02:50:14,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:50:14 WrapperNode [2023-12-21 02:50:14,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 02:50:14,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 02:50:14,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 02:50:14,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 02:50:14,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:50:14" (1/1) ... [2023-12-21 02:50:14,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:50:14" (1/1) ... [2023-12-21 02:50:14,556 INFO L138 Inliner]: procedures = 29, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 512 [2023-12-21 02:50:14,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 02:50:14,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 02:50:14,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 02:50:14,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 02:50:14,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:50:14" (1/1) ... [2023-12-21 02:50:14,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:50:14" (1/1) ... [2023-12-21 02:50:14,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:50:14" (1/1) ... [2023-12-21 02:50:14,597 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 16 writes are split as follows [0, 16]. [2023-12-21 02:50:14,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:50:14" (1/1) ... [2023-12-21 02:50:14,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:50:14" (1/1) ... [2023-12-21 02:50:14,608 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:50:14" (1/1) ... [2023-12-21 02:50:14,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:50:14" (1/1) ... [2023-12-21 02:50:14,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:50:14" (1/1) ... [2023-12-21 02:50:14,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:50:14" (1/1) ... [2023-12-21 02:50:14,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 02:50:14,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 02:50:14,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 02:50:14,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 02:50:14,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:50:14" (1/1) ... [2023-12-21 02:50:14,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:50:14,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:50:14,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 02:50:14,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 02:50:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 02:50:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 02:50:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 02:50:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 02:50:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 02:50:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 02:50:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 02:50:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 02:50:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 02:50:14,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 02:50:14,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 02:50:14,708 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 02:50:14,708 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 02:50:14,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 02:50:14,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 02:50:14,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 02:50:14,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 02:50:14,814 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 02:50:14,815 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 02:50:15,181 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 02:50:15,213 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 02:50:15,213 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 02:50:15,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:50:15 BoogieIcfgContainer [2023-12-21 02:50:15,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 02:50:15,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 02:50:15,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 02:50:15,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 02:50:15,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:50:14" (1/3) ... [2023-12-21 02:50:15,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e5bfd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:50:15, skipping insertion in model container [2023-12-21 02:50:15,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:50:14" (2/3) ... [2023-12-21 02:50:15,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e5bfd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:50:15, skipping insertion in model container [2023-12-21 02:50:15,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:50:15" (3/3) ... [2023-12-21 02:50:15,219 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-70.i [2023-12-21 02:50:15,230 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 02:50:15,231 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 02:50:15,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 02:50:15,265 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;@626c1a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 02:50:15,265 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 02:50:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:50:15,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 02:50:15,282 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:50:15,282 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:50:15,283 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:50:15,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:50:15,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1648714533, now seen corresponding path program 1 times [2023-12-21 02:50:15,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:50:15,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464758819] [2023-12-21 02:50:15,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:50:15,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:50:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:50:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:50:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:50:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:50:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:50:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:50:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:50:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:50:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:50:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:50:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:50:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:50:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:50:15,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:50:15,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464758819] [2023-12-21 02:50:15,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464758819] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:50:15,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:50:15,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 02:50:15,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554576148] [2023-12-21 02:50:15,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:50:15,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 02:50:15,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:50:15,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 02:50:15,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:50:15,593 INFO L87 Difference]: Start difference. First operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:50:15,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:50:15,648 INFO L93 Difference]: Finished difference Result 185 states and 292 transitions. [2023-12-21 02:50:15,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 02:50:15,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-21 02:50:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:50:15,656 INFO L225 Difference]: With dead ends: 185 [2023-12-21 02:50:15,657 INFO L226 Difference]: Without dead ends: 92 [2023-12-21 02:50:15,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:50:15,661 INFO L413 NwaCegarLoop]: 132 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, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:50:15,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:50:15,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-21 02:50:15,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-21 02:50:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.435897435897436) internal successors, (112), 78 states have internal predecessors, (112), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:50:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2023-12-21 02:50:15,692 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 110 [2023-12-21 02:50:15,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:50:15,692 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2023-12-21 02:50:15,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:50:15,693 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2023-12-21 02:50:15,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 02:50:15,695 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:50:15,695 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:50:15,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 02:50:15,696 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:50:15,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:50:15,696 INFO L85 PathProgramCache]: Analyzing trace with hash 463453259, now seen corresponding path program 1 times [2023-12-21 02:50:15,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:50:15,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299607705] [2023-12-21 02:50:15,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:50:15,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:50:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:50:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:50:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:50:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:50:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:50:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:50:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:50:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:50:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:50:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:50:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:50:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:50:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:50:15,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:50:15,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299607705] [2023-12-21 02:50:15,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299607705] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:50:15,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:50:15,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:50:15,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181608235] [2023-12-21 02:50:15,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:50:15,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:50:15,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:50:15,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:50:15,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:50:15,962 INFO L87 Difference]: Start difference. First operand 92 states and 136 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:50:16,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:50:16,027 INFO L93 Difference]: Finished difference Result 189 states and 280 transitions. [2023-12-21 02:50:16,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:50:16,028 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), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-21 02:50:16,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:50:16,030 INFO L225 Difference]: With dead ends: 189 [2023-12-21 02:50:16,030 INFO L226 Difference]: Without dead ends: 98 [2023-12-21 02:50:16,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:50:16,031 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 10 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:50:16,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 388 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:50:16,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-21 02:50:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2023-12-21 02:50:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.425) internal successors, (114), 80 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:50:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 138 transitions. [2023-12-21 02:50:16,046 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 138 transitions. Word has length 110 [2023-12-21 02:50:16,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:50:16,048 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 138 transitions. [2023-12-21 02:50:16,048 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), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:50:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 138 transitions. [2023-12-21 02:50:16,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 02:50:16,049 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:50:16,050 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:50:16,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 02:50:16,050 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:50:16,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:50:16,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1195420685, now seen corresponding path program 1 times [2023-12-21 02:50:16,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:50:16,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911120064] [2023-12-21 02:50:16,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:50:16,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:50:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:50:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:50:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:50:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:50:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:50:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:50:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:50:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:50:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:50:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:50:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:50:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:50:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,274 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:50:16,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:50:16,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911120064] [2023-12-21 02:50:16,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911120064] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:50:16,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:50:16,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:50:16,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886888657] [2023-12-21 02:50:16,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:50:16,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:50:16,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:50:16,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:50:16,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:50:16,279 INFO L87 Difference]: Start difference. First operand 94 states and 138 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:50:16,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:50:16,311 INFO L93 Difference]: Finished difference Result 208 states and 307 transitions. [2023-12-21 02:50:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:50:16,311 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-21 02:50:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:50:16,313 INFO L225 Difference]: With dead ends: 208 [2023-12-21 02:50:16,313 INFO L226 Difference]: Without dead ends: 115 [2023-12-21 02:50:16,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:50:16,314 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 39 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:50:16,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 425 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:50:16,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-21 02:50:16,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2023-12-21 02:50:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 82 states have internal predecessors, (116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:50:16,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2023-12-21 02:50:16,321 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 110 [2023-12-21 02:50:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:50:16,321 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2023-12-21 02:50:16,321 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:50:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2023-12-21 02:50:16,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-21 02:50:16,322 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:50:16,322 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:50:16,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 02:50:16,323 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:50:16,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:50:16,323 INFO L85 PathProgramCache]: Analyzing trace with hash 760131474, now seen corresponding path program 1 times [2023-12-21 02:50:16,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:50:16,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658100967] [2023-12-21 02:50:16,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:50:16,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:50:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:50:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:50:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:50:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:50:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:50:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:50:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:50:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:50:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:50:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:50:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:50:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:50:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:50:16,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:50:16,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658100967] [2023-12-21 02:50:16,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658100967] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:50:16,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:50:16,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:50:16,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181926343] [2023-12-21 02:50:16,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:50:16,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:50:16,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:50:16,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:50:16,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:50:16,463 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:50:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:50:16,497 INFO L93 Difference]: Finished difference Result 199 states and 290 transitions. [2023-12-21 02:50:16,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:50:16,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-21 02:50:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:50:16,499 INFO L225 Difference]: With dead ends: 199 [2023-12-21 02:50:16,500 INFO L226 Difference]: Without dead ends: 104 [2023-12-21 02:50:16,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:50:16,507 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 12 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 384 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-21 02:50:16,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 384 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:50:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-21 02:50:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-12-21 02:50:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:50:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 142 transitions. [2023-12-21 02:50:16,520 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 142 transitions. Word has length 112 [2023-12-21 02:50:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:50:16,520 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 142 transitions. [2023-12-21 02:50:16,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:50:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 142 transitions. [2023-12-21 02:50:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-21 02:50:16,521 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:50:16,521 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:50:16,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 02:50:16,521 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:50:16,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:50:16,522 INFO L85 PathProgramCache]: Analyzing trace with hash 817389776, now seen corresponding path program 1 times [2023-12-21 02:50:16,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:50:16,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102906935] [2023-12-21 02:50:16,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:50:16,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:50:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:50:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:50:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:50:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:50:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:50:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:50:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:50:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:50:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:50:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:50:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:50:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:50:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:50:16,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:50:16,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102906935] [2023-12-21 02:50:16,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102906935] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:50:16,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:50:16,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:50:16,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706806782] [2023-12-21 02:50:16,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:50:16,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:50:16,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:50:16,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:50:16,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:50:16,633 INFO L87 Difference]: Start difference. First operand 98 states and 142 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:50:16,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:50:16,661 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2023-12-21 02:50:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:50:16,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-21 02:50:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:50:16,663 INFO L225 Difference]: With dead ends: 199 [2023-12-21 02:50:16,663 INFO L226 Difference]: Without dead ends: 102 [2023-12-21 02:50:16,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:50:16,665 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 3 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 385 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-21 02:50:16,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 385 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:50:16,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-21 02:50:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2023-12-21 02:50:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:50:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 144 transitions. [2023-12-21 02:50:16,681 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 144 transitions. Word has length 112 [2023-12-21 02:50:16,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:50:16,682 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 144 transitions. [2023-12-21 02:50:16,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:50:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 144 transitions. [2023-12-21 02:50:16,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-21 02:50:16,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:50:16,687 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:50:16,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 02:50:16,687 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:50:16,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:50:16,687 INFO L85 PathProgramCache]: Analyzing trace with hash 817449358, now seen corresponding path program 1 times [2023-12-21 02:50:16,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:50:16,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794650387] [2023-12-21 02:50:16,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:50:16,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:50:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:17,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:50:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:17,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:50:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:17,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:50:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:17,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:50:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:17,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:50:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:17,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:50:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:17,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:50:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:17,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:50:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:17,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:50:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:17,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:50:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:17,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:50:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:17,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:50:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:50:17,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:50:17,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794650387] [2023-12-21 02:50:17,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794650387] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:50:17,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:50:17,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 02:50:17,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518679847] [2023-12-21 02:50:17,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:50:17,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 02:50:17,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:50:17,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 02:50:17,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:50:17,648 INFO L87 Difference]: Start difference. First operand 100 states and 144 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:50:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:50:18,125 INFO L93 Difference]: Finished difference Result 264 states and 379 transitions. [2023-12-21 02:50:18,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:50:18,126 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2023-12-21 02:50:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:50:18,127 INFO L225 Difference]: With dead ends: 264 [2023-12-21 02:50:18,127 INFO L226 Difference]: Without dead ends: 165 [2023-12-21 02:50:18,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-21 02:50:18,127 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 312 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 02:50:18,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 384 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 02:50:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-12-21 02:50:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 112. [2023-12-21 02:50:18,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:50:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2023-12-21 02:50:18,135 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 112 [2023-12-21 02:50:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:50:18,136 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2023-12-21 02:50:18,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:50:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2023-12-21 02:50:18,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-21 02:50:18,137 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:50:18,137 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:50:18,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 02:50:18,137 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:50:18,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:50:18,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1859313861, now seen corresponding path program 1 times [2023-12-21 02:50:18,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:50:18,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994042236] [2023-12-21 02:50:18,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:50:18,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:50:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:50:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:50:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:50:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:50:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:50:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:50:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:50:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:50:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:50:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:50:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:50:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:50:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,351 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:50:18,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:50:18,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994042236] [2023-12-21 02:50:18,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994042236] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:50:18,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:50:18,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:50:18,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156224680] [2023-12-21 02:50:18,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:50:18,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:50:18,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:50:18,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:50:18,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:50:18,353 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:50:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:50:18,468 INFO L93 Difference]: Finished difference Result 273 states and 392 transitions. [2023-12-21 02:50:18,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:50:18,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-21 02:50:18,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:50:18,469 INFO L225 Difference]: With dead ends: 273 [2023-12-21 02:50:18,469 INFO L226 Difference]: Without dead ends: 162 [2023-12-21 02:50:18,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:50:18,471 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 146 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:50:18,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 392 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:50:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-12-21 02:50:18,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 114. [2023-12-21 02:50:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:50:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2023-12-21 02:50:18,480 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 113 [2023-12-21 02:50:18,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:50:18,480 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2023-12-21 02:50:18,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:50:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2023-12-21 02:50:18,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-21 02:50:18,481 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:50:18,481 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:50:18,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 02:50:18,481 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:50:18,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:50:18,481 INFO L85 PathProgramCache]: Analyzing trace with hash 837730171, now seen corresponding path program 1 times [2023-12-21 02:50:18,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:50:18,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047334183] [2023-12-21 02:50:18,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:50:18,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:50:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:50:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:50:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:50:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:50:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:50:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:50:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:50:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:50:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:50:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:50:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:50:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:50:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:50:18,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:50:18,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047334183] [2023-12-21 02:50:18,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047334183] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:50:18,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:50:18,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:50:18,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499750836] [2023-12-21 02:50:18,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:50:18,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:50:18,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:50:18,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:50:18,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:50:18,621 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:50:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:50:18,661 INFO L93 Difference]: Finished difference Result 248 states and 356 transitions. [2023-12-21 02:50:18,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:50:18,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-21 02:50:18,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:50:18,662 INFO L225 Difference]: With dead ends: 248 [2023-12-21 02:50:18,662 INFO L226 Difference]: Without dead ends: 135 [2023-12-21 02:50:18,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:50:18,664 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 64 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 520 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-21 02:50:18,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 520 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:50:18,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-21 02:50:18,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 117. [2023-12-21 02:50:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:50:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2023-12-21 02:50:18,671 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 113 [2023-12-21 02:50:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:50:18,672 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2023-12-21 02:50:18,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:50:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2023-12-21 02:50:18,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:50:18,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:50:18,674 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:50:18,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 02:50:18,674 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:50:18,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:50:18,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1979924589, now seen corresponding path program 1 times [2023-12-21 02:50:18,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:50:18,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147629421] [2023-12-21 02:50:18,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:50:18,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:50:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:50:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:50:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:50:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:50:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:50:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:50:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:50:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:50:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:50:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:50:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:50:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:50:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:50:18,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:50:18,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147629421] [2023-12-21 02:50:18,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147629421] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:50:18,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:50:18,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:50:18,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746869751] [2023-12-21 02:50:18,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:50:18,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:50:18,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:50:18,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:50:18,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:50:18,838 INFO L87 Difference]: Start difference. First operand 117 states and 167 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:50:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:50:18,852 INFO L93 Difference]: Finished difference Result 233 states and 333 transitions. [2023-12-21 02:50:18,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:50:18,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-21 02:50:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:50:18,853 INFO L225 Difference]: With dead ends: 233 [2023-12-21 02:50:18,853 INFO L226 Difference]: Without dead ends: 117 [2023-12-21 02:50:18,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:50:18,854 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:50:18,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:50:18,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-21 02:50:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-12-21 02:50:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 103 states have internal predecessors, (141), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:50:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 165 transitions. [2023-12-21 02:50:18,860 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 165 transitions. Word has length 114 [2023-12-21 02:50:18,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:50:18,860 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 165 transitions. [2023-12-21 02:50:18,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:50:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 165 transitions. [2023-12-21 02:50:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:50:18,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:50:18,861 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:50:18,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 02:50:18,861 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:50:18,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:50:18,862 INFO L85 PathProgramCache]: Analyzing trace with hash 320898001, now seen corresponding path program 1 times [2023-12-21 02:50:18,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:50:18,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869039717] [2023-12-21 02:50:18,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:50:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:50:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:22,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:50:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:22,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:50:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:22,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:50:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:22,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:50:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:22,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:50:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:22,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:50:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:22,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:50:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:22,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:50:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:22,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:50:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:22,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:50:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:22,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:50:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:22,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:50:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:50:22,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:50:22,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869039717] [2023-12-21 02:50:22,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869039717] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:50:22,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:50:22,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-21 02:50:22,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709772861] [2023-12-21 02:50:22,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:50:22,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-21 02:50:22,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:50:22,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-21 02:50:22,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2023-12-21 02:50:22,541 INFO L87 Difference]: Start difference. First operand 117 states and 165 transitions. Second operand has 17 states, 16 states have (on average 3.5625) internal successors, (57), 17 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 02:50:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:50:24,931 INFO L93 Difference]: Finished difference Result 359 states and 498 transitions. [2023-12-21 02:50:24,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-21 02:50:24,932 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.5625) internal successors, (57), 17 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 114 [2023-12-21 02:50:24,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:50:24,933 INFO L225 Difference]: With dead ends: 359 [2023-12-21 02:50:24,933 INFO L226 Difference]: Without dead ends: 243 [2023-12-21 02:50:24,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2023-12-21 02:50:24,934 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 516 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:50:24,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 800 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-21 02:50:24,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-12-21 02:50:24,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 134. [2023-12-21 02:50:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 120 states have (on average 1.375) internal successors, (165), 120 states have internal predecessors, (165), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:50:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 189 transitions. [2023-12-21 02:50:24,943 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 189 transitions. Word has length 114 [2023-12-21 02:50:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:50:24,943 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 189 transitions. [2023-12-21 02:50:24,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.5625) internal successors, (57), 17 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 02:50:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 189 transitions. [2023-12-21 02:50:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:50:24,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:50:24,945 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:50:24,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 02:50:24,945 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:50:24,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:50:24,946 INFO L85 PathProgramCache]: Analyzing trace with hash -958965677, now seen corresponding path program 1 times [2023-12-21 02:50:24,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:50:24,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607115974] [2023-12-21 02:50:24,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:50:24,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:50:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:26,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:50:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:26,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:50:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:26,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:50:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:26,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:50:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:26,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:50:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:26,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:50:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:26,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:50:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:26,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:50:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:26,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:50:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:26,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:50:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:26,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:50:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:27,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:50:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:50:27,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:50:27,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607115974] [2023-12-21 02:50:27,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607115974] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:50:27,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:50:27,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-21 02:50:27,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668763471] [2023-12-21 02:50:27,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:50:27,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 02:50:27,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:50:27,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 02:50:27,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-21 02:50:27,011 INFO L87 Difference]: Start difference. First operand 134 states and 189 transitions. Second operand has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-21 02:50:28,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:50:28,094 INFO L93 Difference]: Finished difference Result 369 states and 513 transitions. [2023-12-21 02:50:28,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 02:50:28,094 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 114 [2023-12-21 02:50:28,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:50:28,096 INFO L225 Difference]: With dead ends: 369 [2023-12-21 02:50:28,096 INFO L226 Difference]: Without dead ends: 236 [2023-12-21 02:50:28,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2023-12-21 02:50:28,097 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 463 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 02:50:28,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 746 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 02:50:28,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-12-21 02:50:28,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 211. [2023-12-21 02:50:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 194 states have (on average 1.3608247422680413) internal successors, (264), 195 states have internal predecessors, (264), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 02:50:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2023-12-21 02:50:28,119 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 114 [2023-12-21 02:50:28,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:50:28,119 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2023-12-21 02:50:28,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-21 02:50:28,119 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2023-12-21 02:50:28,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:50:28,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:50:28,120 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:50:28,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 02:50:28,120 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:50:28,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:50:28,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1530563285, now seen corresponding path program 1 times [2023-12-21 02:50:28,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:50:28,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057016355] [2023-12-21 02:50:28,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:50:28,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:50:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:28,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:50:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:28,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:50:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:28,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:50:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:28,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:50:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:28,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:50:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:50:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:28,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:50:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:28,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:50:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:28,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:50:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:28,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:50:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:28,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:50:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:28,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:50:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:50:28,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:50:28,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057016355] [2023-12-21 02:50:28,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057016355] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:50:28,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:50:28,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 02:50:28,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813579193] [2023-12-21 02:50:28,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:50:28,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:50:28,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:50:28,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:50:28,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:50:28,631 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:50:28,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:50:28,960 INFO L93 Difference]: Finished difference Result 530 states and 727 transitions. [2023-12-21 02:50:28,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 02:50:28,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-21 02:50:28,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:50:28,964 INFO L225 Difference]: With dead ends: 530 [2023-12-21 02:50:28,964 INFO L226 Difference]: Without dead ends: 320 [2023-12-21 02:50:28,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-21 02:50:28,965 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 329 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:50:28,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 511 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:50:28,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-12-21 02:50:28,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 211. [2023-12-21 02:50:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 194 states have (on average 1.3556701030927836) internal successors, (263), 195 states have internal predecessors, (263), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 02:50:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 291 transitions. [2023-12-21 02:50:28,979 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 291 transitions. Word has length 114 [2023-12-21 02:50:28,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:50:28,979 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 291 transitions. [2023-12-21 02:50:28,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:50:28,979 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 291 transitions. [2023-12-21 02:50:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:50:28,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:50:28,980 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:50:28,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 02:50:28,980 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:50:28,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:50:28,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2050841261, now seen corresponding path program 1 times [2023-12-21 02:50:28,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:50:28,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646274304] [2023-12-21 02:50:28,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:50:28,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:50:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:29,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:50:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:29,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:50:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:29,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:50:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:29,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:50:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:29,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:50:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:29,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:50:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:29,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:50:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:29,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:50:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:29,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:50:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:29,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:50:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:29,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:50:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:29,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:50:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:50:29,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:50:29,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646274304] [2023-12-21 02:50:29,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646274304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:50:29,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:50:29,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 02:50:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845252899] [2023-12-21 02:50:29,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:50:29,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 02:50:29,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:50:29,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 02:50:29,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:50:29,585 INFO L87 Difference]: Start difference. First operand 211 states and 291 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:50:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:50:29,907 INFO L93 Difference]: Finished difference Result 503 states and 687 transitions. [2023-12-21 02:50:29,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:50:29,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-21 02:50:29,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:50:29,909 INFO L225 Difference]: With dead ends: 503 [2023-12-21 02:50:29,909 INFO L226 Difference]: Without dead ends: 292 [2023-12-21 02:50:29,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-21 02:50:29,910 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 295 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:50:29,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 494 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:50:29,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-12-21 02:50:29,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 198. [2023-12-21 02:50:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 181 states have (on average 1.3480662983425415) internal successors, (244), 182 states have internal predecessors, (244), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 02:50:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 272 transitions. [2023-12-21 02:50:29,924 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 272 transitions. Word has length 114 [2023-12-21 02:50:29,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:50:29,926 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 272 transitions. [2023-12-21 02:50:29,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:50:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 272 transitions. [2023-12-21 02:50:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:50:29,927 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:50:29,927 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:50:29,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 02:50:29,928 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:50:29,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:50:29,928 INFO L85 PathProgramCache]: Analyzing trace with hash 964262357, now seen corresponding path program 1 times [2023-12-21 02:50:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:50:29,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156484969] [2023-12-21 02:50:29,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:50:29,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:50:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:31,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:50:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:31,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:50:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:31,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:50:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:31,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:50:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:31,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:50:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:31,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:50:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:31,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:50:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:31,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:50:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:31,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:50:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:31,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:50:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:31,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:50:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:31,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:50:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:50:31,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:50:31,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156484969] [2023-12-21 02:50:31,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156484969] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:50:31,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:50:31,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-21 02:50:31,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139192345] [2023-12-21 02:50:31,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:50:31,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 02:50:31,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:50:31,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 02:50:31,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-12-21 02:50:31,073 INFO L87 Difference]: Start difference. First operand 198 states and 272 transitions. Second operand has 12 states, 10 states have (on average 5.7) internal successors, (57), 12 states have internal predecessors, (57), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-21 02:50:31,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:50:31,532 INFO L93 Difference]: Finished difference Result 387 states and 533 transitions. [2023-12-21 02:50:31,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 02:50:31,533 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.7) internal successors, (57), 12 states have internal predecessors, (57), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 114 [2023-12-21 02:50:31,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:50:31,534 INFO L225 Difference]: With dead ends: 387 [2023-12-21 02:50:31,534 INFO L226 Difference]: Without dead ends: 190 [2023-12-21 02:50:31,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2023-12-21 02:50:31,534 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 111 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:50:31,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 408 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:50:31,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-12-21 02:50:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2023-12-21 02:50:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 172 states have (on average 1.3313953488372092) internal successors, (229), 173 states have internal predecessors, (229), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 02:50:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 257 transitions. [2023-12-21 02:50:31,547 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 257 transitions. Word has length 114 [2023-12-21 02:50:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:50:31,547 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 257 transitions. [2023-12-21 02:50:31,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.7) internal successors, (57), 12 states have internal predecessors, (57), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-21 02:50:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 257 transitions. [2023-12-21 02:50:31,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:50:31,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:50:31,548 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:50:31,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 02:50:31,548 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:50:31,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:50:31,548 INFO L85 PathProgramCache]: Analyzing trace with hash -841175977, now seen corresponding path program 1 times [2023-12-21 02:50:31,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:50:31,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44294859] [2023-12-21 02:50:31,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:50:31,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:50:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:50:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:40,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:50:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:40,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:50:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:40,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:50:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:40,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:50:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:40,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:50:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:40,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:50:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:41,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:50:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:41,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:50:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:41,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:50:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:41,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:50:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:41,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:50:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:50:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:50:41,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:50:41,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44294859] [2023-12-21 02:50:41,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44294859] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:50:41,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:50:41,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-21 02:50:41,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334813373] [2023-12-21 02:50:41,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:50:41,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 02:50:41,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:50:41,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 02:50:41,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-21 02:50:41,064 INFO L87 Difference]: Start difference. First operand 189 states and 257 transitions. Second operand has 18 states, 16 states have (on average 3.5625) internal successors, (57), 18 states have internal predecessors, (57), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-21 02:50:44,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:50:48,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:51:01,143 WARN L293 SmtUtils]: Spent 9.63s on a formula simplification. DAG size of input: 140 DAG size of output: 137 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 02:51:12,939 WARN L293 SmtUtils]: Spent 7.67s on a formula simplification. DAG size of input: 163 DAG size of output: 132 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 02:51:35,600 WARN L293 SmtUtils]: Spent 19.52s on a formula simplification. DAG size of input: 167 DAG size of output: 153 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 02:51:52,867 WARN L293 SmtUtils]: Spent 15.60s on a formula simplification. DAG size of input: 168 DAG size of output: 154 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 02:51:59,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:52:00,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:52:00,187 INFO L93 Difference]: Finished difference Result 478 states and 645 transitions. [2023-12-21 02:52:00,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-21 02:52:00,187 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.5625) internal successors, (57), 18 states have internal predecessors, (57), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 114 [2023-12-21 02:52:00,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:52:00,188 INFO L225 Difference]: With dead ends: 478 [2023-12-21 02:52:00,189 INFO L226 Difference]: Without dead ends: 290 [2023-12-21 02:52:00,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 66.3s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2023-12-21 02:52:00,190 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 462 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2023-12-21 02:52:00,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 802 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 17.5s Time] [2023-12-21 02:52:00,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-12-21 02:52:00,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 186. [2023-12-21 02:52:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 169 states have (on average 1.331360946745562) internal successors, (225), 170 states have internal predecessors, (225), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 02:52:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 253 transitions. [2023-12-21 02:52:00,202 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 253 transitions. Word has length 114 [2023-12-21 02:52:00,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:52:00,203 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 253 transitions. [2023-12-21 02:52:00,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.5625) internal successors, (57), 18 states have internal predecessors, (57), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-21 02:52:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 253 transitions. [2023-12-21 02:52:00,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-21 02:52:00,203 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:52:00,203 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:52:00,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 02:52:00,204 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:52:00,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:52:00,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1955897890, now seen corresponding path program 1 times [2023-12-21 02:52:00,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:52:00,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334791984] [2023-12-21 02:52:00,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:52:00,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:52:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:00,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:52:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:00,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:52:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:00,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:52:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:00,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:52:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:00,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:52:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:00,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:52:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:00,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:52:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:00,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:52:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:00,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:52:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:00,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:52:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:00,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:52:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:00,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:52:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:52:00,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:52:00,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334791984] [2023-12-21 02:52:00,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334791984] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:52:00,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:52:00,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:52:00,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327164703] [2023-12-21 02:52:00,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:52:00,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:52:00,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:52:00,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:52:00,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:52:00,342 INFO L87 Difference]: Start difference. First operand 186 states and 253 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:52:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:52:00,449 INFO L93 Difference]: Finished difference Result 372 states and 505 transitions. [2023-12-21 02:52:00,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:52:00,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-12-21 02:52:00,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:52:00,451 INFO L225 Difference]: With dead ends: 372 [2023-12-21 02:52:00,451 INFO L226 Difference]: Without dead ends: 187 [2023-12-21 02:52:00,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:52:00,452 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 10 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:52:00,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 399 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:52:00,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-21 02:52:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2023-12-21 02:52:00,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 168 states have (on average 1.3214285714285714) internal successors, (222), 169 states have internal predecessors, (222), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 02:52:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 250 transitions. [2023-12-21 02:52:00,479 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 250 transitions. Word has length 116 [2023-12-21 02:52:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:52:00,479 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 250 transitions. [2023-12-21 02:52:00,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:52:00,479 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 250 transitions. [2023-12-21 02:52:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-21 02:52:00,480 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:52:00,480 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:52:00,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 02:52:00,480 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:52:00,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:52:00,481 INFO L85 PathProgramCache]: Analyzing trace with hash -542142946, now seen corresponding path program 1 times [2023-12-21 02:52:00,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:52:00,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133971269] [2023-12-21 02:52:00,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:52:00,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:52:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:01,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:52:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:01,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:52:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:01,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:52:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:01,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:52:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:01,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:52:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:01,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:52:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:01,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:52:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:01,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:52:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:01,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:52:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:01,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:52:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:01,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:52:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:01,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:52:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:52:01,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:52:01,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133971269] [2023-12-21 02:52:01,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133971269] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:52:01,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:52:01,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-21 02:52:01,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854802417] [2023-12-21 02:52:01,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:52:01,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 02:52:01,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:52:01,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 02:52:01,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-21 02:52:01,988 INFO L87 Difference]: Start difference. First operand 185 states and 250 transitions. Second operand has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 02:52:03,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:52:03,037 INFO L93 Difference]: Finished difference Result 512 states and 682 transitions. [2023-12-21 02:52:03,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 02:52:03,038 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 116 [2023-12-21 02:52:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:52:03,040 INFO L225 Difference]: With dead ends: 512 [2023-12-21 02:52:03,040 INFO L226 Difference]: Without dead ends: 328 [2023-12-21 02:52:03,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2023-12-21 02:52:03,041 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 337 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 02:52:03,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 428 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 02:52:03,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-12-21 02:52:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 244. [2023-12-21 02:52:03,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 227 states have (on average 1.2951541850220265) internal successors, (294), 228 states have internal predecessors, (294), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 02:52:03,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 322 transitions. [2023-12-21 02:52:03,055 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 322 transitions. Word has length 116 [2023-12-21 02:52:03,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:52:03,055 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 322 transitions. [2023-12-21 02:52:03,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 02:52:03,055 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 322 transitions. [2023-12-21 02:52:03,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 02:52:03,056 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:52:03,056 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:52:03,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 02:52:03,056 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:52:03,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:52:03,057 INFO L85 PathProgramCache]: Analyzing trace with hash 346926195, now seen corresponding path program 1 times [2023-12-21 02:52:03,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:52:03,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55879516] [2023-12-21 02:52:03,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:52:03,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:52:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:03,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:52:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:03,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:52:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:03,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:52:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:03,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:52:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:03,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:52:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:03,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:52:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:03,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:52:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:03,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:52:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:03,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:52:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:03,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:52:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:03,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:52:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:03,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:52:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:52:03,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:52:03,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55879516] [2023-12-21 02:52:03,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55879516] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:52:03,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:52:03,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 02:52:03,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864514068] [2023-12-21 02:52:03,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:52:03,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 02:52:03,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:52:03,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 02:52:03,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:52:03,442 INFO L87 Difference]: Start difference. First operand 244 states and 322 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:52:03,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:52:03,791 INFO L93 Difference]: Finished difference Result 512 states and 676 transitions. [2023-12-21 02:52:03,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 02:52:03,791 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2023-12-21 02:52:03,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:52:03,793 INFO L225 Difference]: With dead ends: 512 [2023-12-21 02:52:03,793 INFO L226 Difference]: Without dead ends: 269 [2023-12-21 02:52:03,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2023-12-21 02:52:03,794 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 311 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:52:03,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 459 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:52:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-12-21 02:52:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 238. [2023-12-21 02:52:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 221 states have (on average 1.2941176470588236) internal successors, (286), 222 states have internal predecessors, (286), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 02:52:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 314 transitions. [2023-12-21 02:52:03,810 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 314 transitions. Word has length 117 [2023-12-21 02:52:03,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:52:03,810 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 314 transitions. [2023-12-21 02:52:03,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:52:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 314 transitions. [2023-12-21 02:52:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 02:52:03,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:52:03,811 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:52:03,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-21 02:52:03,811 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:52:03,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:52:03,811 INFO L85 PathProgramCache]: Analyzing trace with hash 408965809, now seen corresponding path program 1 times [2023-12-21 02:52:03,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:52:03,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355915693] [2023-12-21 02:52:03,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:52:03,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:52:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:05,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:52:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:05,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:52:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:05,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:52:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:05,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:52:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:05,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:52:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:05,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:52:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:05,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:52:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:05,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:52:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:05,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:52:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:05,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:52:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:05,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:52:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:05,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:52:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:52:05,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:52:05,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355915693] [2023-12-21 02:52:05,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355915693] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:52:05,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:52:05,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-21 02:52:05,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568036695] [2023-12-21 02:52:05,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:52:05,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 02:52:05,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:52:05,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 02:52:05,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-12-21 02:52:05,110 INFO L87 Difference]: Start difference. First operand 238 states and 314 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:52:06,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:52:06,402 INFO L93 Difference]: Finished difference Result 711 states and 932 transitions. [2023-12-21 02:52:06,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 02:52:06,403 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-12-21 02:52:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:52:06,405 INFO L225 Difference]: With dead ends: 711 [2023-12-21 02:52:06,405 INFO L226 Difference]: Without dead ends: 474 [2023-12-21 02:52:06,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2023-12-21 02:52:06,406 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 406 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 02:52:06,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 892 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 02:52:06,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2023-12-21 02:52:06,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 261. [2023-12-21 02:52:06,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 244 states have (on average 1.2950819672131149) internal successors, (316), 245 states have internal predecessors, (316), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 02:52:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 344 transitions. [2023-12-21 02:52:06,422 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 344 transitions. Word has length 117 [2023-12-21 02:52:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:52:06,422 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 344 transitions. [2023-12-21 02:52:06,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:52:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 344 transitions. [2023-12-21 02:52:06,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 02:52:06,423 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:52:06,423 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:52:06,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-21 02:52:06,424 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:52:06,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:52:06,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1962773453, now seen corresponding path program 1 times [2023-12-21 02:52:06,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:52:06,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763293834] [2023-12-21 02:52:06,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:52:06,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:52:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:06,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:52:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:06,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:52:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:06,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:52:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:06,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:52:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:06,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:52:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:06,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:52:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:06,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:52:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:06,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:52:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:06,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:52:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:06,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:52:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:06,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:52:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:06,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:52:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:06,809 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:52:06,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:52:06,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763293834] [2023-12-21 02:52:06,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763293834] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:52:06,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:52:06,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 02:52:06,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891382114] [2023-12-21 02:52:06,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:52:06,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:52:06,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:52:06,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:52:06,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:52:06,811 INFO L87 Difference]: Start difference. First operand 261 states and 344 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:52:07,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:52:07,115 INFO L93 Difference]: Finished difference Result 637 states and 835 transitions. [2023-12-21 02:52:07,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:52:07,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2023-12-21 02:52:07,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:52:07,117 INFO L225 Difference]: With dead ends: 637 [2023-12-21 02:52:07,117 INFO L226 Difference]: Without dead ends: 377 [2023-12-21 02:52:07,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-12-21 02:52:07,118 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 446 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:52:07,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 285 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:52:07,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-12-21 02:52:07,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 245. [2023-12-21 02:52:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 228 states have (on average 1.293859649122807) internal successors, (295), 229 states have internal predecessors, (295), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 02:52:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 323 transitions. [2023-12-21 02:52:07,133 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 323 transitions. Word has length 117 [2023-12-21 02:52:07,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:52:07,134 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 323 transitions. [2023-12-21 02:52:07,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:52:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 323 transitions. [2023-12-21 02:52:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 02:52:07,135 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:52:07,135 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:52:07,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-21 02:52:07,135 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:52:07,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:52:07,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1562546643, now seen corresponding path program 1 times [2023-12-21 02:52:07,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:52:07,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353166974] [2023-12-21 02:52:07,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:52:07,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:52:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:07,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:52:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:07,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:52:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:07,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:52:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:07,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:52:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:07,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:52:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:07,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:52:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:07,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:52:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:07,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:52:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:07,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:52:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:07,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:52:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:07,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:52:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:07,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:52:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:52:07,978 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:52:07,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:52:07,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353166974] [2023-12-21 02:52:07,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353166974] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:52:07,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:52:07,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-21 02:52:07,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320281386] [2023-12-21 02:52:07,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:52:07,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 02:52:07,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:52:07,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 02:52:07,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-12-21 02:52:07,980 INFO L87 Difference]: Start difference. First operand 245 states and 323 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:52:08,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:52:08,708 INFO L93 Difference]: Finished difference Result 601 states and 785 transitions. [2023-12-21 02:52:08,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 02:52:08,708 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2023-12-21 02:52:08,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:52:08,710 INFO L225 Difference]: With dead ends: 601 [2023-12-21 02:52:08,710 INFO L226 Difference]: Without dead ends: 357 [2023-12-21 02:52:08,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2023-12-21 02:52:08,711 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 401 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 02:52:08,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 564 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 02:52:08,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2023-12-21 02:52:08,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 229. [2023-12-21 02:52:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 212 states have (on average 1.2877358490566038) internal successors, (273), 213 states have internal predecessors, (273), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 02:52:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 301 transitions. [2023-12-21 02:52:08,731 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 301 transitions. Word has length 117 [2023-12-21 02:52:08,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:52:08,732 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 301 transitions. [2023-12-21 02:52:08,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:52:08,732 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 301 transitions. [2023-12-21 02:52:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-21 02:52:08,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:52:08,733 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:52:08,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-21 02:52:08,733 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:52:08,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:52:08,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1773825603, now seen corresponding path program 1 times [2023-12-21 02:52:08,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:52:08,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250842104] [2023-12-21 02:52:08,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:52:08,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:52:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:52:08,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 02:52:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:52:08,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 02:52:08,912 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 02:52:08,913 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:52:08,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-21 02:52:08,916 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:52:08,919 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:52:08,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:52:08 BoogieIcfgContainer [2023-12-21 02:52:08,997 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:52:08,998 INFO L158 Benchmark]: Toolchain (without parser) took 114754.65ms. Allocated memory was 290.5MB in the beginning and 694.2MB in the end (delta: 403.7MB). Free memory was 240.3MB in the beginning and 620.5MB in the end (delta: -380.3MB). Peak memory consumption was 401.7MB. Max. memory is 8.0GB. [2023-12-21 02:52:08,998 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:52:08,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.63ms. Allocated memory is still 290.5MB. Free memory was 240.3MB in the beginning and 224.2MB in the end (delta: 16.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-21 02:52:08,998 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.81ms. Allocated memory is still 290.5MB. Free memory was 224.2MB in the beginning and 220.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:52:08,998 INFO L158 Benchmark]: Boogie Preprocessor took 60.41ms. Allocated memory is still 290.5MB. Free memory was 220.0MB in the beginning and 215.1MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-21 02:52:08,999 INFO L158 Benchmark]: RCFGBuilder took 594.19ms. Allocated memory is still 290.5MB. Free memory was 215.1MB in the beginning and 245.1MB in the end (delta: -29.9MB). Peak memory consumption was 28.6MB. Max. memory is 8.0GB. [2023-12-21 02:52:08,999 INFO L158 Benchmark]: TraceAbstraction took 113782.53ms. Allocated memory was 290.5MB in the beginning and 694.2MB in the end (delta: 403.7MB). Free memory was 244.5MB in the beginning and 620.5MB in the end (delta: -376.0MB). Peak memory consumption was 405.6MB. Max. memory is 8.0GB. [2023-12-21 02:52:08,999 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 200.3MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.63ms. Allocated memory is still 290.5MB. Free memory was 240.3MB in the beginning and 224.2MB in the end (delta: 16.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.81ms. Allocated memory is still 290.5MB. Free memory was 224.2MB in the beginning and 220.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.41ms. Allocated memory is still 290.5MB. Free memory was 220.0MB in the beginning and 215.1MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 594.19ms. Allocated memory is still 290.5MB. Free memory was 215.1MB in the beginning and 245.1MB in the end (delta: -29.9MB). Peak memory consumption was 28.6MB. Max. memory is 8.0GB. * TraceAbstraction took 113782.53ms. Allocated memory was 290.5MB in the beginning and 694.2MB in the end (delta: 403.7MB). Free memory was 244.5MB in the beginning and 620.5MB in the end (delta: -376.0MB). Peak memory consumption was 405.6MB. 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 107, overapproximation of bitwise operation at line 118, overapproximation of someBinaryArithmeticDOUBLEoperation at line 90. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L55] unsigned short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] unsigned short int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L58] signed char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L59] signed long int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L60] double* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L61] double* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L62] double* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L63] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L64] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L65] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L66] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L67] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L68] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] FCALL updateLastVariables() [L126] CALL updateVariables() [L94] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, cond=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, cond=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L97] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, cond=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, cond=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L100] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_9 [L101] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_9 [L101] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L101] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L101] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, cond=1, isInitial=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L102] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L103] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L103] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L103] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, cond=1, isInitial=1] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L104] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L105] EXPR WrapperStruct00.var_1_11 [L105] EXPR WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_11 [L105] EXPR WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L105] EXPR (WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L105] EXPR (WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, cond=1, isInitial=1] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L106] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L107] EXPR WrapperStruct00.var_1_12 [L107] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_12 [L107] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L107] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L107] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, cond=1, isInitial=1] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L108] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, cond=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, cond=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L111] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L112] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, cond=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, cond=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L126] RET updateVariables() [L127] CALL step() [L72] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L72] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L73] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L73] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_16_Pointer)) [L74] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L74] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L77] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L77] (*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L77] (*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L77] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) [L80] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L80] unsigned short int stepLocal_0 = (*(WrapperStruct00_var_1_4_Pointer)); [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L81] EXPR (*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, stepLocal_0=16383] [L81] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)))) [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L81] EXPR (*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)) [L81] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, stepLocal_0=16383] [L81] COND TRUE stepLocal_0 <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)))))) [L82] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L82] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))) [L82] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L82] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, stepLocal_0=16383] [L82] (*(WrapperStruct00_var_1_7_Pointer)) = ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))) [L86] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L86] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_13_Pointer)); [L87] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L87] COND FALSE !((*(WrapperStruct00_var_1_13_Pointer)) < stepLocal_1) [L90] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L90] (*(WrapperStruct00_var_1_8_Pointer)) = (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1 [L118] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1) [L118] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L118] EXPR (*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1 [L118] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer))))))) [L118] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L118] EXPR (*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)))) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L118] EXPR (*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)) [L118] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))) [L118] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L118] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118-L119] return ((((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=0, cond=0, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=0, cond=0, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 113.7s, OverallIterations: 22, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 88.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4682 SdHoareTripleChecker+Valid, 23.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4673 mSDsluCounter, 10056 SdHoareTripleChecker+Invalid, 22.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7594 mSDsCounter, 195 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8940 IncrementalHoareTripleChecker+Invalid, 9135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 195 mSolverCounterUnsat, 2462 mSDtfsCounter, 8940 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 823 GetRequests, 580 SyntacticMatches, 2 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 71.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=19, InterpolantAutomatonStates: 180, 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, 21 MinimizatonAttempts, 1182 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 23.3s InterpolantComputationTime, 2508 NumberOfCodeBlocks, 2508 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2369 ConstructedInterpolants, 0 QuantifiedInterpolants, 28622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 5544/5544 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-21 02:52:09,048 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...