/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 16:23:52,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 16:23:52,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 16:23:52,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 16:23:52,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 16:23:52,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 16:23:52,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 16:23:52,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 16:23:52,688 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 16:23:52,691 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 16:23:52,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 16:23:52,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 16:23:52,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 16:23:52,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 16:23:52,693 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 16:23:52,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 16:23:52,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 16:23:52,693 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 16:23:52,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 16:23:52,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 16:23:52,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 16:23:52,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 16:23:52,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 16:23:52,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 16:23:52,694 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 16:23:52,694 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 16:23:52,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 16:23:52,695 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 16:23:52,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 16:23:52,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 16:23:52,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 16:23:52,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 16:23:52,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 16:23:52,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 16:23:52,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 16:23:52,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 16:23:52,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 16:23:52,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 16:23:52,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 16:23:52,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 16:23:52,697 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 16:23:52,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 16:23:52,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 16:23:52,697 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 16:23:52,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 16:23:52,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 16:23:52,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 16:23:52,891 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 16:23:52,891 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 16:23:52,891 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-88.i [2023-12-19 16:23:53,900 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 16:23:54,093 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 16:23:54,094 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i [2023-12-19 16:23:54,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ceb0eab2/53aa9d47d6b5473eb2bee1cfed0878d5/FLAG1751b4247 [2023-12-19 16:23:54,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ceb0eab2/53aa9d47d6b5473eb2bee1cfed0878d5 [2023-12-19 16:23:54,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 16:23:54,119 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 16:23:54,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 16:23:54,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 16:23:54,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 16:23:54,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:23:54" (1/1) ... [2023-12-19 16:23:54,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3abb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:23:54, skipping insertion in model container [2023-12-19 16:23:54,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:23:54" (1/1) ... [2023-12-19 16:23:54,145 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 16:23:54,237 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-88.i[917,930] [2023-12-19 16:23:54,287 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 16:23:54,297 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 16:23:54,305 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-88.i[917,930] [2023-12-19 16:23:54,326 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 16:23:54,340 INFO L206 MainTranslator]: Completed translation [2023-12-19 16:23:54,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:23:54 WrapperNode [2023-12-19 16:23:54,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 16:23:54,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 16:23:54,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 16:23:54,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 16:23:54,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:23:54" (1/1) ... [2023-12-19 16:23:54,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:23:54" (1/1) ... [2023-12-19 16:23:54,381 INFO L138 Inliner]: procedures = 29, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 535 [2023-12-19 16:23:54,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 16:23:54,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 16:23:54,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 16:23:54,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 16:23:54,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:23:54" (1/1) ... [2023-12-19 16:23:54,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:23:54" (1/1) ... [2023-12-19 16:23:54,396 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:23:54" (1/1) ... [2023-12-19 16:23:54,410 INFO L175 MemorySlicer]: Split 134 memory accesses to 2 slices as follows [2, 132]. 99 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 19 writes are split as follows [0, 19]. [2023-12-19 16:23:54,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:23:54" (1/1) ... [2023-12-19 16:23:54,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:23:54" (1/1) ... [2023-12-19 16:23:54,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:23:54" (1/1) ... [2023-12-19 16:23:54,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:23:54" (1/1) ... [2023-12-19 16:23:54,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:23:54" (1/1) ... [2023-12-19 16:23:54,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:23:54" (1/1) ... [2023-12-19 16:23:54,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 16:23:54,457 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 16:23:54,457 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 16:23:54,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 16:23:54,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:23:54" (1/1) ... [2023-12-19 16:23:54,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 16:23:54,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 16:23:54,494 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 16:23:54,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 16:23:54,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 16:23:54,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 16:23:54,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 16:23:54,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 16:23:54,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 16:23:54,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 16:23:54,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 16:23:54,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 16:23:54,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 16:23:54,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 16:23:54,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 16:23:54,522 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 16:23:54,522 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 16:23:54,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 16:23:54,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 16:23:54,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 16:23:54,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 16:23:54,625 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 16:23:54,626 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 16:23:54,936 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 16:23:54,961 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 16:23:54,961 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 16:23:54,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:23:54 BoogieIcfgContainer [2023-12-19 16:23:54,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 16:23:54,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 16:23:54,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 16:23:54,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 16:23:54,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 04:23:54" (1/3) ... [2023-12-19 16:23:54,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46910d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:23:54, skipping insertion in model container [2023-12-19 16:23:54,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:23:54" (2/3) ... [2023-12-19 16:23:54,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46910d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:23:54, skipping insertion in model container [2023-12-19 16:23:54,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:23:54" (3/3) ... [2023-12-19 16:23:54,967 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-88.i [2023-12-19 16:23:54,982 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 16:23:54,982 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 16:23:55,012 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 16:23:55,016 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;@326c8074, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 16:23:55,016 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 16:23:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 90 states have (on average 1.4666666666666666) internal successors, (132), 91 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-19 16:23:55,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-19 16:23:55,037 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:23:55,037 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:23:55,038 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:23:55,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:23:55,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1126820053, now seen corresponding path program 1 times [2023-12-19 16:23:55,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:23:55,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002028578] [2023-12-19 16:23:55,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:23:55,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:23:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:23:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:23:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:23:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:23:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:23:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:23:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:23:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:23:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:23:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:23:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:23:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:23:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:23:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:23:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:23:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:23:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:23:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:23:55,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:23:55,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002028578] [2023-12-19 16:23:55,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002028578] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:23:55,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:23:55,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 16:23:55,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509097265] [2023-12-19 16:23:55,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:23:55,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 16:23:55,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:23:55,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 16:23:55,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 16:23:55,367 INFO L87 Difference]: Start difference. First operand has 110 states, 90 states have (on average 1.4666666666666666) internal successors, (132), 91 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:23:55,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:23:55,420 INFO L93 Difference]: Finished difference Result 217 states and 347 transitions. [2023-12-19 16:23:55,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 16:23:55,422 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2023-12-19 16:23:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:23:55,429 INFO L225 Difference]: With dead ends: 217 [2023-12-19 16:23:55,430 INFO L226 Difference]: Without dead ends: 108 [2023-12-19 16:23:55,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 16:23:55,436 INFO L413 NwaCegarLoop]: 157 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, 157 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-19 16:23:55,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:23:55,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-19 16:23:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-12-19 16:23:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 89 states have internal predecessors, (127), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-19 16:23:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 161 transitions. [2023-12-19 16:23:55,481 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 161 transitions. Word has length 138 [2023-12-19 16:23:55,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:23:55,481 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 161 transitions. [2023-12-19 16:23:55,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:23:55,482 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 161 transitions. [2023-12-19 16:23:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-19 16:23:55,491 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:23:55,491 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:23:55,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 16:23:55,492 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:23:55,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:23:55,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1112524267, now seen corresponding path program 1 times [2023-12-19 16:23:55,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:23:55,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915120224] [2023-12-19 16:23:55,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:23:55,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:23:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:23:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:23:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:23:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:23:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:23:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:23:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:23:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:23:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:23:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:23:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:23:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:23:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:23:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:23:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:23:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:23:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:23:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:23:55,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:23:55,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915120224] [2023-12-19 16:23:55,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915120224] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:23:55,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:23:55,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 16:23:55,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423549624] [2023-12-19 16:23:55,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:23:55,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 16:23:55,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:23:55,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 16:23:55,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 16:23:55,790 INFO L87 Difference]: Start difference. First operand 108 states and 161 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:23:55,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:23:55,841 INFO L93 Difference]: Finished difference Result 227 states and 338 transitions. [2023-12-19 16:23:55,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 16:23:55,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2023-12-19 16:23:55,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:23:55,846 INFO L225 Difference]: With dead ends: 227 [2023-12-19 16:23:55,846 INFO L226 Difference]: Without dead ends: 120 [2023-12-19 16:23:55,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:23:55,847 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 21 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 462 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-19 16:23:55,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 462 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:23:55,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-19 16:23:55,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2023-12-19 16:23:55,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-19 16:23:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 163 transitions. [2023-12-19 16:23:55,854 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 163 transitions. Word has length 138 [2023-12-19 16:23:55,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:23:55,856 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 163 transitions. [2023-12-19 16:23:55,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:23:55,856 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 163 transitions. [2023-12-19 16:23:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-19 16:23:55,857 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:23:55,857 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:23:55,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 16:23:55,857 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:23:55,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:23:55,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1921870893, now seen corresponding path program 1 times [2023-12-19 16:23:55,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:23:55,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93130194] [2023-12-19 16:23:55,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:23:55,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:23:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:23:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:23:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:23:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:23:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:23:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:23:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:23:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:23:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:23:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:23:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:23:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:23:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:23:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:23:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:23:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:23:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:23:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:23:56,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:23:56,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93130194] [2023-12-19 16:23:56,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93130194] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:23:56,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:23:56,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 16:23:56,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473138200] [2023-12-19 16:23:56,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:23:56,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 16:23:56,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:23:56,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 16:23:56,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 16:23:56,116 INFO L87 Difference]: Start difference. First operand 110 states and 163 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:23:56,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:23:56,158 INFO L93 Difference]: Finished difference Result 227 states and 336 transitions. [2023-12-19 16:23:56,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 16:23:56,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2023-12-19 16:23:56,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:23:56,165 INFO L225 Difference]: With dead ends: 227 [2023-12-19 16:23:56,166 INFO L226 Difference]: Without dead ends: 118 [2023-12-19 16:23:56,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:23:56,170 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 12 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 460 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-19 16:23:56,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 460 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:23:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-19 16:23:56,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2023-12-19 16:23:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-19 16:23:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 165 transitions. [2023-12-19 16:23:56,176 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 165 transitions. Word has length 138 [2023-12-19 16:23:56,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:23:56,177 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 165 transitions. [2023-12-19 16:23:56,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:23:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 165 transitions. [2023-12-19 16:23:56,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-19 16:23:56,178 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:23:56,178 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:23:56,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 16:23:56,178 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:23:56,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:23:56,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1864612591, now seen corresponding path program 1 times [2023-12-19 16:23:56,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:23:56,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039481779] [2023-12-19 16:23:56,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:23:56,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:23:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:23:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:23:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:23:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:23:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:23:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:23:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:23:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:23:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:23:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:23:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:23:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:23:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:23:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:23:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:23:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:23:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:23:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:23:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:23:57,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:23:57,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039481779] [2023-12-19 16:23:57,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039481779] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:23:57,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:23:57,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 16:23:57,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841606942] [2023-12-19 16:23:57,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:23:57,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 16:23:57,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:23:57,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 16:23:57,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-19 16:23:57,887 INFO L87 Difference]: Start difference. First operand 112 states and 165 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:23:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:23:58,519 INFO L93 Difference]: Finished difference Result 312 states and 458 transitions. [2023-12-19 16:23:58,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 16:23:58,520 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2023-12-19 16:23:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:23:58,521 INFO L225 Difference]: With dead ends: 312 [2023-12-19 16:23:58,522 INFO L226 Difference]: Without dead ends: 201 [2023-12-19 16:23:58,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2023-12-19 16:23:58,530 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 427 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 16:23:58,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 502 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 16:23:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-19 16:23:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 129. [2023-12-19 16:23:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 110 states have (on average 1.4272727272727272) internal successors, (157), 110 states have internal predecessors, (157), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-19 16:23:58,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2023-12-19 16:23:58,552 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 138 [2023-12-19 16:23:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:23:58,553 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2023-12-19 16:23:58,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:23:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2023-12-19 16:23:58,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-19 16:23:58,555 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:23:58,555 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:23:58,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 16:23:58,555 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:23:58,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:23:58,555 INFO L85 PathProgramCache]: Analyzing trace with hash -762723850, now seen corresponding path program 1 times [2023-12-19 16:23:58,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:23:58,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229140578] [2023-12-19 16:23:58,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:23:58,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:23:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:00,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:00,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229140578] [2023-12-19 16:24:00,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229140578] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:00,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:00,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 16:24:00,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032253090] [2023-12-19 16:24:00,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:00,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 16:24:00,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:00,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 16:24:00,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:24:00,243 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:24:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:00,867 INFO L93 Difference]: Finished difference Result 344 states and 507 transitions. [2023-12-19 16:24:00,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 16:24:00,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2023-12-19 16:24:00,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:00,871 INFO L225 Difference]: With dead ends: 344 [2023-12-19 16:24:00,871 INFO L226 Difference]: Without dead ends: 216 [2023-12-19 16:24:00,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2023-12-19 16:24:00,872 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 592 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:00,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 338 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:24:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-12-19 16:24:00,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 131. [2023-12-19 16:24:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 112 states have (on average 1.4285714285714286) internal successors, (160), 112 states have internal predecessors, (160), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-19 16:24:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 194 transitions. [2023-12-19 16:24:00,897 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 194 transitions. Word has length 140 [2023-12-19 16:24:00,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:00,897 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 194 transitions. [2023-12-19 16:24:00,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:24:00,898 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 194 transitions. [2023-12-19 16:24:00,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-19 16:24:00,899 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:00,899 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:00,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 16:24:00,899 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:00,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:00,900 INFO L85 PathProgramCache]: Analyzing trace with hash 955218079, now seen corresponding path program 1 times [2023-12-19 16:24:00,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:00,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911471571] [2023-12-19 16:24:00,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:00,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:01,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:01,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911471571] [2023-12-19 16:24:01,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911471571] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:01,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:01,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 16:24:01,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998266918] [2023-12-19 16:24:01,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:01,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 16:24:01,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:01,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 16:24:01,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:24:01,037 INFO L87 Difference]: Start difference. First operand 131 states and 194 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:01,086 INFO L93 Difference]: Finished difference Result 288 states and 425 transitions. [2023-12-19 16:24:01,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 16:24:01,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2023-12-19 16:24:01,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:01,088 INFO L225 Difference]: With dead ends: 288 [2023-12-19 16:24:01,088 INFO L226 Difference]: Without dead ends: 158 [2023-12-19 16:24:01,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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-19 16:24:01,089 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 89 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 628 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-19 16:24:01,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 628 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:24:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-12-19 16:24:01,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 134. [2023-12-19 16:24:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 115 states have (on average 1.4173913043478261) internal successors, (163), 115 states have internal predecessors, (163), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-19 16:24:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 197 transitions. [2023-12-19 16:24:01,109 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 197 transitions. Word has length 140 [2023-12-19 16:24:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:01,109 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 197 transitions. [2023-12-19 16:24:01,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 197 transitions. [2023-12-19 16:24:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-19 16:24:01,111 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:01,111 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:01,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 16:24:01,111 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:01,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1654129526, now seen corresponding path program 1 times [2023-12-19 16:24:01,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:01,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891317347] [2023-12-19 16:24:01,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:01,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:02,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:02,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891317347] [2023-12-19 16:24:02,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891317347] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:02,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:02,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 16:24:02,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862495730] [2023-12-19 16:24:02,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:02,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 16:24:02,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:02,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 16:24:02,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-19 16:24:02,667 INFO L87 Difference]: Start difference. First operand 134 states and 197 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:24:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:03,307 INFO L93 Difference]: Finished difference Result 373 states and 545 transitions. [2023-12-19 16:24:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 16:24:03,307 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2023-12-19 16:24:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:03,308 INFO L225 Difference]: With dead ends: 373 [2023-12-19 16:24:03,309 INFO L226 Difference]: Without dead ends: 240 [2023-12-19 16:24:03,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-12-19 16:24:03,309 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 450 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:03,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 385 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 16:24:03,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-12-19 16:24:03,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 134. [2023-12-19 16:24:03,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 115 states have (on average 1.4173913043478261) internal successors, (163), 115 states have internal predecessors, (163), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-19 16:24:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 197 transitions. [2023-12-19 16:24:03,320 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 197 transitions. Word has length 140 [2023-12-19 16:24:03,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:03,321 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 197 transitions. [2023-12-19 16:24:03,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:24:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 197 transitions. [2023-12-19 16:24:03,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-19 16:24:03,322 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:03,322 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:03,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 16:24:03,323 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:03,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:03,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1863701049, now seen corresponding path program 1 times [2023-12-19 16:24:03,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:03,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296507883] [2023-12-19 16:24:03,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:03,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:04,398 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:04,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:04,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296507883] [2023-12-19 16:24:04,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296507883] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:04,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:04,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 16:24:04,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833539446] [2023-12-19 16:24:04,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:04,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 16:24:04,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:04,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 16:24:04,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:24:04,399 INFO L87 Difference]: Start difference. First operand 134 states and 197 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:24:05,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:05,012 INFO L93 Difference]: Finished difference Result 358 states and 521 transitions. [2023-12-19 16:24:05,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 16:24:05,012 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2023-12-19 16:24:05,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:05,013 INFO L225 Difference]: With dead ends: 358 [2023-12-19 16:24:05,013 INFO L226 Difference]: Without dead ends: 225 [2023-12-19 16:24:05,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2023-12-19 16:24:05,014 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 682 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:05,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 436 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:24:05,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-12-19 16:24:05,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 150. [2023-12-19 16:24:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 131 states have (on average 1.4427480916030535) internal successors, (189), 131 states have internal predecessors, (189), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-19 16:24:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 223 transitions. [2023-12-19 16:24:05,023 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 223 transitions. Word has length 141 [2023-12-19 16:24:05,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:05,024 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 223 transitions. [2023-12-19 16:24:05,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:24:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 223 transitions. [2023-12-19 16:24:05,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-19 16:24:05,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:05,025 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:05,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 16:24:05,025 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:05,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:05,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1411166950, now seen corresponding path program 1 times [2023-12-19 16:24:05,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:05,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50257816] [2023-12-19 16:24:05,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:05,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:05,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:05,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50257816] [2023-12-19 16:24:05,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50257816] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:05,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:05,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 16:24:05,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181713723] [2023-12-19 16:24:05,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:05,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 16:24:05,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:05,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 16:24:05,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 16:24:05,394 INFO L87 Difference]: Start difference. First operand 150 states and 223 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:05,616 INFO L93 Difference]: Finished difference Result 449 states and 668 transitions. [2023-12-19 16:24:05,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 16:24:05,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 142 [2023-12-19 16:24:05,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:05,618 INFO L225 Difference]: With dead ends: 449 [2023-12-19 16:24:05,618 INFO L226 Difference]: Without dead ends: 300 [2023-12-19 16:24:05,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:24:05,620 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 129 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:05,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 362 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:24:05,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-19 16:24:05,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 243. [2023-12-19 16:24:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 206 states have (on average 1.4029126213592233) internal successors, (289), 206 states have internal predecessors, (289), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 357 transitions. [2023-12-19 16:24:05,654 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 357 transitions. Word has length 142 [2023-12-19 16:24:05,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:05,654 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 357 transitions. [2023-12-19 16:24:05,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:05,654 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 357 transitions. [2023-12-19 16:24:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 16:24:05,655 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:05,655 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:05,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 16:24:05,655 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:05,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:05,655 INFO L85 PathProgramCache]: Analyzing trace with hash 341475904, now seen corresponding path program 1 times [2023-12-19 16:24:05,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:05,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494801741] [2023-12-19 16:24:05,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:05,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:05,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:05,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494801741] [2023-12-19 16:24:05,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494801741] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:05,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:05,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 16:24:05,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606328429] [2023-12-19 16:24:05,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:05,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 16:24:05,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:05,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 16:24:05,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 16:24:05,921 INFO L87 Difference]: Start difference. First operand 243 states and 357 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:06,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:06,209 INFO L93 Difference]: Finished difference Result 494 states and 726 transitions. [2023-12-19 16:24:06,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 16:24:06,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2023-12-19 16:24:06,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:06,211 INFO L225 Difference]: With dead ends: 494 [2023-12-19 16:24:06,212 INFO L226 Difference]: Without dead ends: 300 [2023-12-19 16:24:06,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-19 16:24:06,213 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 128 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:06,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 575 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:24:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-19 16:24:06,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 243. [2023-12-19 16:24:06,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 206 states have (on average 1.3980582524271845) internal successors, (288), 206 states have internal predecessors, (288), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 356 transitions. [2023-12-19 16:24:06,251 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 356 transitions. Word has length 144 [2023-12-19 16:24:06,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:06,254 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 356 transitions. [2023-12-19 16:24:06,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:06,254 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 356 transitions. [2023-12-19 16:24:06,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 16:24:06,255 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:06,255 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:06,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 16:24:06,256 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:06,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:06,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1709508094, now seen corresponding path program 1 times [2023-12-19 16:24:06,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:06,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173401481] [2023-12-19 16:24:06,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:06,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:06,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:06,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173401481] [2023-12-19 16:24:06,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173401481] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:06,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:06,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 16:24:06,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989087223] [2023-12-19 16:24:06,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:06,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 16:24:06,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:06,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 16:24:06,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:24:06,512 INFO L87 Difference]: Start difference. First operand 243 states and 356 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:06,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:06,702 INFO L93 Difference]: Finished difference Result 543 states and 789 transitions. [2023-12-19 16:24:06,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:24:06,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2023-12-19 16:24:06,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:06,706 INFO L225 Difference]: With dead ends: 543 [2023-12-19 16:24:06,706 INFO L226 Difference]: Without dead ends: 394 [2023-12-19 16:24:06,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:24:06,707 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 221 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:06,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 479 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 16:24:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-12-19 16:24:06,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 251. [2023-12-19 16:24:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 214 states have (on average 1.4018691588785046) internal successors, (300), 214 states have internal predecessors, (300), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 368 transitions. [2023-12-19 16:24:06,739 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 368 transitions. Word has length 144 [2023-12-19 16:24:06,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:06,739 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 368 transitions. [2023-12-19 16:24:06,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 368 transitions. [2023-12-19 16:24:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 16:24:06,740 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:06,740 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:06,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 16:24:06,740 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:06,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:06,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1286806268, now seen corresponding path program 1 times [2023-12-19 16:24:06,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:06,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599471385] [2023-12-19 16:24:06,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:06,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:06,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:06,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599471385] [2023-12-19 16:24:06,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599471385] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:06,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:06,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 16:24:06,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429377017] [2023-12-19 16:24:06,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:06,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 16:24:06,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:06,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 16:24:06,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:24:06,964 INFO L87 Difference]: Start difference. First operand 251 states and 368 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:07,244 INFO L93 Difference]: Finished difference Result 536 states and 780 transitions. [2023-12-19 16:24:07,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:24:07,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2023-12-19 16:24:07,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:07,247 INFO L225 Difference]: With dead ends: 536 [2023-12-19 16:24:07,247 INFO L226 Difference]: Without dead ends: 379 [2023-12-19 16:24:07,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:24:07,247 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 351 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:07,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 737 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:24:07,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-12-19 16:24:07,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 257. [2023-12-19 16:24:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 220 states have (on average 1.3909090909090909) internal successors, (306), 220 states have internal predecessors, (306), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 374 transitions. [2023-12-19 16:24:07,267 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 374 transitions. Word has length 144 [2023-12-19 16:24:07,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:07,268 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 374 transitions. [2023-12-19 16:24:07,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 374 transitions. [2023-12-19 16:24:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 16:24:07,269 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:07,269 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:07,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 16:24:07,269 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:07,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:07,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1794517167, now seen corresponding path program 1 times [2023-12-19 16:24:07,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:07,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910339192] [2023-12-19 16:24:07,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:07,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:08,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:08,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:08,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:08,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:08,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:08,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:08,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:08,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:08,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:08,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:08,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:08,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:09,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:09,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:09,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:09,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:09,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:09,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:09,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910339192] [2023-12-19 16:24:09,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910339192] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:09,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:09,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 16:24:09,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110778703] [2023-12-19 16:24:09,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:09,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 16:24:09,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:09,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 16:24:09,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:24:09,054 INFO L87 Difference]: Start difference. First operand 257 states and 374 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:24:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:09,579 INFO L93 Difference]: Finished difference Result 451 states and 659 transitions. [2023-12-19 16:24:09,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:24:09,580 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 144 [2023-12-19 16:24:09,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:09,581 INFO L225 Difference]: With dead ends: 451 [2023-12-19 16:24:09,581 INFO L226 Difference]: Without dead ends: 294 [2023-12-19 16:24:09,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-12-19 16:24:09,582 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 571 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:09,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 296 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:24:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-12-19 16:24:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 225. [2023-12-19 16:24:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 188 states have (on average 1.372340425531915) internal successors, (258), 188 states have internal predecessors, (258), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:09,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 326 transitions. [2023-12-19 16:24:09,602 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 326 transitions. Word has length 144 [2023-12-19 16:24:09,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:09,602 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 326 transitions. [2023-12-19 16:24:09,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:24:09,602 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 326 transitions. [2023-12-19 16:24:09,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-19 16:24:09,603 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:09,604 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:09,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 16:24:09,604 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:09,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:09,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1729444484, now seen corresponding path program 1 times [2023-12-19 16:24:09,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:09,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527505441] [2023-12-19 16:24:09,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:09,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:10,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:10,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:10,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:10,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:10,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:10,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:11,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:11,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:11,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:11,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:11,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:11,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:11,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:11,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:11,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:11,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:11,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:11,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:11,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527505441] [2023-12-19 16:24:11,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527505441] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:11,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:11,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 16:24:11,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928010168] [2023-12-19 16:24:11,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:11,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 16:24:11,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:11,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 16:24:11,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-19 16:24:11,135 INFO L87 Difference]: Start difference. First operand 225 states and 326 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:24:11,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:11,850 INFO L93 Difference]: Finished difference Result 477 states and 688 transitions. [2023-12-19 16:24:11,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 16:24:11,850 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2023-12-19 16:24:11,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:11,851 INFO L225 Difference]: With dead ends: 477 [2023-12-19 16:24:11,851 INFO L226 Difference]: Without dead ends: 338 [2023-12-19 16:24:11,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2023-12-19 16:24:11,852 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 695 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:11,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 437 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:24:11,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-12-19 16:24:11,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 229. [2023-12-19 16:24:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 192 states have (on average 1.375) internal successors, (264), 192 states have internal predecessors, (264), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 332 transitions. [2023-12-19 16:24:11,879 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 332 transitions. Word has length 145 [2023-12-19 16:24:11,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:11,880 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 332 transitions. [2023-12-19 16:24:11,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:24:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 332 transitions. [2023-12-19 16:24:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-19 16:24:11,881 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:11,881 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:11,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 16:24:11,881 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:11,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:11,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1166117241, now seen corresponding path program 1 times [2023-12-19 16:24:11,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:11,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100572669] [2023-12-19 16:24:11,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:11,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:12,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:12,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100572669] [2023-12-19 16:24:12,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100572669] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:12,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:12,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 16:24:12,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121780226] [2023-12-19 16:24:12,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:12,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 16:24:12,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:12,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 16:24:12,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:24:12,485 INFO L87 Difference]: Start difference. First operand 229 states and 332 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:12,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:12,772 INFO L93 Difference]: Finished difference Result 461 states and 665 transitions. [2023-12-19 16:24:12,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 16:24:12,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2023-12-19 16:24:12,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:12,774 INFO L225 Difference]: With dead ends: 461 [2023-12-19 16:24:12,774 INFO L226 Difference]: Without dead ends: 320 [2023-12-19 16:24:12,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-12-19 16:24:12,776 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 312 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:12,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 559 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:24:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-12-19 16:24:12,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 282. [2023-12-19 16:24:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 245 states have (on average 1.379591836734694) internal successors, (338), 245 states have internal predecessors, (338), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 406 transitions. [2023-12-19 16:24:12,796 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 406 transitions. Word has length 145 [2023-12-19 16:24:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:12,796 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 406 transitions. [2023-12-19 16:24:12,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 406 transitions. [2023-12-19 16:24:12,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-19 16:24:12,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:12,798 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:12,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-19 16:24:12,798 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:12,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:12,798 INFO L85 PathProgramCache]: Analyzing trace with hash -618218492, now seen corresponding path program 1 times [2023-12-19 16:24:12,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:12,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251846511] [2023-12-19 16:24:12,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:12,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:14,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:14,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251846511] [2023-12-19 16:24:14,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251846511] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:14,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:14,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 16:24:14,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345185854] [2023-12-19 16:24:14,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:14,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 16:24:14,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:14,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 16:24:14,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:24:14,395 INFO L87 Difference]: Start difference. First operand 282 states and 406 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:24:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:15,172 INFO L93 Difference]: Finished difference Result 675 states and 971 transitions. [2023-12-19 16:24:15,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 16:24:15,173 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2023-12-19 16:24:15,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:15,175 INFO L225 Difference]: With dead ends: 675 [2023-12-19 16:24:15,175 INFO L226 Difference]: Without dead ends: 491 [2023-12-19 16:24:15,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2023-12-19 16:24:15,176 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 448 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:15,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 479 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 16:24:15,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2023-12-19 16:24:15,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 282. [2023-12-19 16:24:15,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 245 states have (on average 1.379591836734694) internal successors, (338), 245 states have internal predecessors, (338), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:15,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 406 transitions. [2023-12-19 16:24:15,202 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 406 transitions. Word has length 145 [2023-12-19 16:24:15,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:15,203 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 406 transitions. [2023-12-19 16:24:15,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:24:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 406 transitions. [2023-12-19 16:24:15,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 16:24:15,206 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:15,206 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:15,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 16:24:15,207 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:15,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:15,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1741357100, now seen corresponding path program 1 times [2023-12-19 16:24:15,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:15,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082218128] [2023-12-19 16:24:15,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:15,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:15,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:15,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082218128] [2023-12-19 16:24:15,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082218128] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:15,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:15,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 16:24:15,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732729391] [2023-12-19 16:24:15,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:15,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 16:24:15,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:15,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 16:24:15,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:24:15,276 INFO L87 Difference]: Start difference. First operand 282 states and 406 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:15,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:15,308 INFO L93 Difference]: Finished difference Result 484 states and 702 transitions. [2023-12-19 16:24:15,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 16:24:15,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2023-12-19 16:24:15,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:15,310 INFO L225 Difference]: With dead ends: 484 [2023-12-19 16:24:15,310 INFO L226 Difference]: Without dead ends: 286 [2023-12-19 16:24:15,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:24:15,311 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:15,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:24:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-12-19 16:24:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2023-12-19 16:24:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 249 states have (on average 1.3734939759036144) internal successors, (342), 249 states have internal predecessors, (342), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 410 transitions. [2023-12-19 16:24:15,333 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 410 transitions. Word has length 147 [2023-12-19 16:24:15,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:15,334 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 410 transitions. [2023-12-19 16:24:15,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:15,334 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 410 transitions. [2023-12-19 16:24:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 16:24:15,335 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:15,335 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:15,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 16:24:15,335 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:15,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:15,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1304704232, now seen corresponding path program 1 times [2023-12-19 16:24:15,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:15,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297859494] [2023-12-19 16:24:15,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:15,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:16,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:16,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:16,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:16,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:16,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:16,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:16,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:16,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:16,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:16,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:16,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:16,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:16,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:16,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297859494] [2023-12-19 16:24:16,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297859494] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:16,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:16,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 16:24:16,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374912260] [2023-12-19 16:24:16,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:16,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 16:24:16,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:16,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 16:24:16,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-19 16:24:16,040 INFO L87 Difference]: Start difference. First operand 286 states and 410 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:16,419 INFO L93 Difference]: Finished difference Result 629 states and 897 transitions. [2023-12-19 16:24:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:24:16,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2023-12-19 16:24:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:16,421 INFO L225 Difference]: With dead ends: 629 [2023-12-19 16:24:16,421 INFO L226 Difference]: Without dead ends: 443 [2023-12-19 16:24:16,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:24:16,422 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 416 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:16,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 425 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:24:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-12-19 16:24:16,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 322. [2023-12-19 16:24:16,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 285 states have (on average 1.3614035087719298) internal successors, (388), 285 states have internal predecessors, (388), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:16,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 456 transitions. [2023-12-19 16:24:16,451 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 456 transitions. Word has length 147 [2023-12-19 16:24:16,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:16,451 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 456 transitions. [2023-12-19 16:24:16,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:16,451 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 456 transitions. [2023-12-19 16:24:16,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 16:24:16,452 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:16,452 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:16,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-19 16:24:16,453 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:16,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:16,453 INFO L85 PathProgramCache]: Analyzing trace with hash 575577323, now seen corresponding path program 1 times [2023-12-19 16:24:16,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:16,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609406692] [2023-12-19 16:24:16,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:16,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-19 16:24:17,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:17,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609406692] [2023-12-19 16:24:17,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609406692] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 16:24:17,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244296452] [2023-12-19 16:24:17,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:17,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 16:24:17,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 16:24:17,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 16:24:17,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 16:24:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:18,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 72 conjunts are in the unsatisfiable core [2023-12-19 16:24:18,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 16:24:18,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-19 16:24:18,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-19 16:24:19,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-19 16:24:19,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-19 16:24:20,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-19 16:24:20,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-19 16:24:21,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 16:24:22,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 16:24:22,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 16:24:23,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:24:23,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:24:23,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 16:24:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 168 proven. 129 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2023-12-19 16:24:23,269 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 16:24:23,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244296452] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 16:24:23,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 16:24:23,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2023-12-19 16:24:23,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596202958] [2023-12-19 16:24:23,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 16:24:23,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-19 16:24:23,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:23,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-19 16:24:23,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2023-12-19 16:24:23,389 INFO L87 Difference]: Start difference. First operand 322 states and 456 transitions. Second operand has 20 states, 17 states have (on average 6.529411764705882) internal successors, (111), 20 states have internal predecessors, (111), 10 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 10 states have call successors, (34) [2023-12-19 16:24:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:24,639 INFO L93 Difference]: Finished difference Result 534 states and 761 transitions. [2023-12-19 16:24:24,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 16:24:24,640 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 6.529411764705882) internal successors, (111), 20 states have internal predecessors, (111), 10 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 10 states have call successors, (34) Word has length 147 [2023-12-19 16:24:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:24,641 INFO L225 Difference]: With dead ends: 534 [2023-12-19 16:24:24,641 INFO L226 Difference]: Without dead ends: 312 [2023-12-19 16:24:24,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2023-12-19 16:24:24,642 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 170 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:24,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 928 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-19 16:24:24,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-12-19 16:24:24,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2023-12-19 16:24:24,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 270 states have (on average 1.362962962962963) internal successors, (368), 270 states have internal predecessors, (368), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 436 transitions. [2023-12-19 16:24:24,666 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 436 transitions. Word has length 147 [2023-12-19 16:24:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:24,666 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 436 transitions. [2023-12-19 16:24:24,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 6.529411764705882) internal successors, (111), 20 states have internal predecessors, (111), 10 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 10 states have call successors, (34) [2023-12-19 16:24:24,666 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 436 transitions. [2023-12-19 16:24:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 16:24:24,667 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:24,667 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:24,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 16:24:24,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 16:24:24,873 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:24,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:24,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1000947049, now seen corresponding path program 1 times [2023-12-19 16:24:24,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:24,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880409015] [2023-12-19 16:24:24,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:24,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:27,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:27,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880409015] [2023-12-19 16:24:27,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880409015] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:27,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:27,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-19 16:24:27,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138815362] [2023-12-19 16:24:27,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:27,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 16:24:27,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:27,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 16:24:27,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-12-19 16:24:27,637 INFO L87 Difference]: Start difference. First operand 308 states and 436 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:30,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:30,161 INFO L93 Difference]: Finished difference Result 663 states and 940 transitions. [2023-12-19 16:24:30,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-19 16:24:30,162 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2023-12-19 16:24:30,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:30,163 INFO L225 Difference]: With dead ends: 663 [2023-12-19 16:24:30,163 INFO L226 Difference]: Without dead ends: 459 [2023-12-19 16:24:30,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=208, Invalid=784, Unknown=0, NotChecked=0, Total=992 [2023-12-19 16:24:30,164 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 516 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:30,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 864 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-19 16:24:30,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2023-12-19 16:24:30,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 314. [2023-12-19 16:24:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 276 states have (on average 1.3623188405797102) internal successors, (376), 276 states have internal predecessors, (376), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 444 transitions. [2023-12-19 16:24:30,192 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 444 transitions. Word has length 147 [2023-12-19 16:24:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:30,192 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 444 transitions. [2023-12-19 16:24:30,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:30,192 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 444 transitions. [2023-12-19 16:24:30,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 16:24:30,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:30,193 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:30,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-19 16:24:30,193 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:30,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:30,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1907816853, now seen corresponding path program 1 times [2023-12-19 16:24:30,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:30,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988019069] [2023-12-19 16:24:30,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:30,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:31,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:31,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988019069] [2023-12-19 16:24:31,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988019069] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:31,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:31,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 16:24:31,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411008940] [2023-12-19 16:24:31,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:31,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 16:24:31,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:31,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 16:24:31,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-19 16:24:31,861 INFO L87 Difference]: Start difference. First operand 314 states and 444 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:24:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:32,576 INFO L93 Difference]: Finished difference Result 574 states and 818 transitions. [2023-12-19 16:24:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 16:24:32,577 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 147 [2023-12-19 16:24:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:32,578 INFO L225 Difference]: With dead ends: 574 [2023-12-19 16:24:32,578 INFO L226 Difference]: Without dead ends: 367 [2023-12-19 16:24:32,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2023-12-19 16:24:32,579 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 528 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:32,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 380 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:24:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-12-19 16:24:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 256. [2023-12-19 16:24:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 218 states have (on average 1.3394495412844036) internal successors, (292), 218 states have internal predecessors, (292), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 360 transitions. [2023-12-19 16:24:32,608 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 360 transitions. Word has length 147 [2023-12-19 16:24:32,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:32,608 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 360 transitions. [2023-12-19 16:24:32,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:24:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 360 transitions. [2023-12-19 16:24:32,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-19 16:24:32,609 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:32,609 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:32,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-19 16:24:32,609 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:32,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:32,609 INFO L85 PathProgramCache]: Analyzing trace with hash 686706957, now seen corresponding path program 1 times [2023-12-19 16:24:32,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:32,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93205918] [2023-12-19 16:24:32,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:32,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:33,485 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:33,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:33,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93205918] [2023-12-19 16:24:33,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93205918] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:33,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:33,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 16:24:33,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399924650] [2023-12-19 16:24:33,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:33,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 16:24:33,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:33,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 16:24:33,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-19 16:24:33,488 INFO L87 Difference]: Start difference. First operand 256 states and 360 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:34,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:34,010 INFO L93 Difference]: Finished difference Result 622 states and 873 transitions. [2023-12-19 16:24:34,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:24:34,010 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2023-12-19 16:24:34,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:34,012 INFO L225 Difference]: With dead ends: 622 [2023-12-19 16:24:34,012 INFO L226 Difference]: Without dead ends: 450 [2023-12-19 16:24:34,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-19 16:24:34,013 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 429 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:34,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 487 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 16:24:34,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2023-12-19 16:24:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 287. [2023-12-19 16:24:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 249 states have (on average 1.3373493975903614) internal successors, (333), 249 states have internal predecessors, (333), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:34,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 401 transitions. [2023-12-19 16:24:34,064 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 401 transitions. Word has length 149 [2023-12-19 16:24:34,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:34,064 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 401 transitions. [2023-12-19 16:24:34,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:34,064 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 401 transitions. [2023-12-19 16:24:34,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-19 16:24:34,065 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:34,065 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:34,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-19 16:24:34,065 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:34,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:34,065 INFO L85 PathProgramCache]: Analyzing trace with hash -42419952, now seen corresponding path program 1 times [2023-12-19 16:24:34,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:34,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868535474] [2023-12-19 16:24:34,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:34,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:36,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:36,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868535474] [2023-12-19 16:24:36,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868535474] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:36,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:36,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-19 16:24:36,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410997155] [2023-12-19 16:24:36,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:36,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 16:24:36,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:36,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 16:24:36,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-12-19 16:24:36,421 INFO L87 Difference]: Start difference. First operand 287 states and 401 transitions. Second operand has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2023-12-19 16:24:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:37,324 INFO L93 Difference]: Finished difference Result 611 states and 857 transitions. [2023-12-19 16:24:37,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 16:24:37,324 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) Word has length 149 [2023-12-19 16:24:37,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:37,326 INFO L225 Difference]: With dead ends: 611 [2023-12-19 16:24:37,326 INFO L226 Difference]: Without dead ends: 432 [2023-12-19 16:24:37,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2023-12-19 16:24:37,326 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 407 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:37,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 509 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 16:24:37,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-12-19 16:24:37,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 398. [2023-12-19 16:24:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 360 states have (on average 1.3555555555555556) internal successors, (488), 360 states have internal predecessors, (488), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 556 transitions. [2023-12-19 16:24:37,362 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 556 transitions. Word has length 149 [2023-12-19 16:24:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:37,362 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 556 transitions. [2023-12-19 16:24:37,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2023-12-19 16:24:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 556 transitions. [2023-12-19 16:24:37,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-19 16:24:37,363 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:37,363 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:37,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-19 16:24:37,363 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:37,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:37,363 INFO L85 PathProgramCache]: Analyzing trace with hash 507013657, now seen corresponding path program 1 times [2023-12-19 16:24:37,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:37,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754970698] [2023-12-19 16:24:37,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:37,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:37,413 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:37,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:37,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754970698] [2023-12-19 16:24:37,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754970698] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:37,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:37,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 16:24:37,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854643576] [2023-12-19 16:24:37,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:37,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 16:24:37,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:37,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 16:24:37,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:24:37,414 INFO L87 Difference]: Start difference. First operand 398 states and 556 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:37,460 INFO L93 Difference]: Finished difference Result 696 states and 984 transitions. [2023-12-19 16:24:37,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 16:24:37,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2023-12-19 16:24:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:37,462 INFO L225 Difference]: With dead ends: 696 [2023-12-19 16:24:37,462 INFO L226 Difference]: Without dead ends: 424 [2023-12-19 16:24:37,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:24:37,464 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 20 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:37,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 312 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:24:37,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2023-12-19 16:24:37,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 402. [2023-12-19 16:24:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 364 states have (on average 1.3516483516483517) internal successors, (492), 364 states have internal predecessors, (492), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 560 transitions. [2023-12-19 16:24:37,498 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 560 transitions. Word has length 149 [2023-12-19 16:24:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:37,498 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 560 transitions. [2023-12-19 16:24:37,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 560 transitions. [2023-12-19 16:24:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-19 16:24:37,499 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:37,499 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:37,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-19 16:24:37,499 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:37,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:37,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1298338445, now seen corresponding path program 1 times [2023-12-19 16:24:37,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:37,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869697509] [2023-12-19 16:24:37,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:37,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:38,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:38,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869697509] [2023-12-19 16:24:38,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869697509] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:38,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:38,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 16:24:38,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083745993] [2023-12-19 16:24:38,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:38,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 16:24:38,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:38,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 16:24:38,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-19 16:24:38,280 INFO L87 Difference]: Start difference. First operand 402 states and 560 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:38,810 INFO L93 Difference]: Finished difference Result 912 states and 1273 transitions. [2023-12-19 16:24:38,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:24:38,810 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2023-12-19 16:24:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:38,812 INFO L225 Difference]: With dead ends: 912 [2023-12-19 16:24:38,812 INFO L226 Difference]: Without dead ends: 636 [2023-12-19 16:24:38,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-12-19 16:24:38,813 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 374 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:38,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 481 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 16:24:38,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2023-12-19 16:24:38,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 426. [2023-12-19 16:24:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 388 states have (on average 1.347938144329897) internal successors, (523), 388 states have internal predecessors, (523), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:38,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 591 transitions. [2023-12-19 16:24:38,848 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 591 transitions. Word has length 149 [2023-12-19 16:24:38,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:38,849 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 591 transitions. [2023-12-19 16:24:38,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:38,849 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 591 transitions. [2023-12-19 16:24:38,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-19 16:24:38,849 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:38,850 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:38,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-19 16:24:38,850 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:38,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:38,850 INFO L85 PathProgramCache]: Analyzing trace with hash 569211536, now seen corresponding path program 1 times [2023-12-19 16:24:38,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:38,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354377380] [2023-12-19 16:24:38,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:38,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:39,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:39,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354377380] [2023-12-19 16:24:39,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354377380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:39,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:39,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 16:24:39,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770355317] [2023-12-19 16:24:39,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:39,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 16:24:39,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:39,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 16:24:39,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 16:24:39,098 INFO L87 Difference]: Start difference. First operand 426 states and 591 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:39,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:39,321 INFO L93 Difference]: Finished difference Result 723 states and 1012 transitions. [2023-12-19 16:24:39,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 16:24:39,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2023-12-19 16:24:39,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:39,324 INFO L225 Difference]: With dead ends: 723 [2023-12-19 16:24:39,324 INFO L226 Difference]: Without dead ends: 403 [2023-12-19 16:24:39,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 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-19 16:24:39,325 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 140 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:39,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 379 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:24:39,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2023-12-19 16:24:39,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 402. [2023-12-19 16:24:39,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 364 states have (on average 1.3461538461538463) internal successors, (490), 364 states have internal predecessors, (490), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 558 transitions. [2023-12-19 16:24:39,371 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 558 transitions. Word has length 149 [2023-12-19 16:24:39,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:39,371 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 558 transitions. [2023-12-19 16:24:39,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 16:24:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 558 transitions. [2023-12-19 16:24:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-19 16:24:39,372 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:39,372 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:39,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-19 16:24:39,372 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:39,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:39,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1992008030, now seen corresponding path program 1 times [2023-12-19 16:24:39,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:39,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967740118] [2023-12-19 16:24:39,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:39,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:24:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:24:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:24:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:24:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 16:24:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 16:24:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:24:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 16:24:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 16:24:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 16:24:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 16:24:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 16:24:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 16:24:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 16:24:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:24:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:24:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:24:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:24:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 16:24:40,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:24:40,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967740118] [2023-12-19 16:24:40,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967740118] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:24:40,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:24:40,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 16:24:40,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435293868] [2023-12-19 16:24:40,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:24:40,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 16:24:40,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:24:40,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 16:24:40,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-19 16:24:40,784 INFO L87 Difference]: Start difference. First operand 402 states and 558 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:24:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:24:41,863 INFO L93 Difference]: Finished difference Result 868 states and 1210 transitions. [2023-12-19 16:24:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 16:24:41,864 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 151 [2023-12-19 16:24:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:24:41,865 INFO L225 Difference]: With dead ends: 868 [2023-12-19 16:24:41,865 INFO L226 Difference]: Without dead ends: 592 [2023-12-19 16:24:41,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2023-12-19 16:24:41,866 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 382 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 16:24:41,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 666 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 16:24:41,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2023-12-19 16:24:41,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 477. [2023-12-19 16:24:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 439 states have (on average 1.3371298405466971) internal successors, (587), 439 states have internal predecessors, (587), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 16:24:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 655 transitions. [2023-12-19 16:24:41,909 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 655 transitions. Word has length 151 [2023-12-19 16:24:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:24:41,909 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 655 transitions. [2023-12-19 16:24:41,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 16:24:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 655 transitions. [2023-12-19 16:24:41,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-19 16:24:41,910 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:24:41,910 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:41,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-19 16:24:41,911 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:24:41,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:24:41,911 INFO L85 PathProgramCache]: Analyzing trace with hash 582355371, now seen corresponding path program 1 times [2023-12-19 16:24:41,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:24:41,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417835889] [2023-12-19 16:24:41,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:24:41,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:24:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 16:24:42,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 16:24:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 16:24:42,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 16:24:42,190 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 16:24:42,191 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 16:24:42,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-19 16:24:42,194 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:24:42,197 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 16:24:42,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 04:24:42 BoogieIcfgContainer [2023-12-19 16:24:42,317 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 16:24:42,317 INFO L158 Benchmark]: Toolchain (without parser) took 48198.35ms. Allocated memory was 254.8MB in the beginning and 1.0GB in the end (delta: 777.0MB). Free memory was 213.7MB in the beginning and 770.8MB in the end (delta: -557.0MB). Peak memory consumption was 220.6MB. Max. memory is 8.0GB. [2023-12-19 16:24:42,320 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 177.2MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 16:24:42,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.42ms. Allocated memory is still 254.8MB. Free memory was 213.7MB in the beginning and 197.5MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-19 16:24:42,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.49ms. Allocated memory is still 254.8MB. Free memory was 197.5MB in the beginning and 193.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 16:24:42,321 INFO L158 Benchmark]: Boogie Preprocessor took 73.80ms. Allocated memory is still 254.8MB. Free memory was 193.8MB in the beginning and 189.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 16:24:42,321 INFO L158 Benchmark]: RCFGBuilder took 504.94ms. Allocated memory is still 254.8MB. Free memory was 189.1MB in the beginning and 153.4MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-19 16:24:42,321 INFO L158 Benchmark]: TraceAbstraction took 47353.40ms. Allocated memory was 254.8MB in the beginning and 1.0GB in the end (delta: 777.0MB). Free memory was 152.9MB in the beginning and 770.8MB in the end (delta: -617.9MB). Peak memory consumption was 159.8MB. Max. memory is 8.0GB. [2023-12-19 16:24:42,326 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.09ms. Allocated memory is still 177.2MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.42ms. Allocated memory is still 254.8MB. Free memory was 213.7MB in the beginning and 197.5MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.49ms. Allocated memory is still 254.8MB. Free memory was 197.5MB in the beginning and 193.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 73.80ms. Allocated memory is still 254.8MB. Free memory was 193.8MB in the beginning and 189.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 504.94ms. Allocated memory is still 254.8MB. Free memory was 189.1MB in the beginning and 153.4MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 47353.40ms. Allocated memory was 254.8MB in the beginning and 1.0GB in the end (delta: 777.0MB). Free memory was 152.9MB in the beginning and 770.8MB in the end (delta: -617.9MB). Peak memory consumption was 159.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 140, overapproximation of bitwiseOr at line 140. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L59] signed char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L60] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L61] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L62] signed char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L63] signed char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L64] signed char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L65] unsigned long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L66] unsigned long int* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L67] unsigned long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L68] unsigned long int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L69] signed long int* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L70] signed short int* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L71] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L72] float* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L73] unsigned char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L74] unsigned char* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L75] unsigned long int last_1_WrapperStruct00_var_1_10 = 25; [L76] signed short int last_1_WrapperStruct00_var_1_15 = -16; [L77] unsigned char last_1_WrapperStruct00_var_1_18 = 0; [L144] isInitial = 1 [L145] FCALL initially() [L146] COND TRUE 1 [L147] CALL updateLastVariables() [L135] EXPR WrapperStruct00.var_1_10 [L135] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L136] EXPR WrapperStruct00.var_1_15 [L136] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L137] EXPR WrapperStruct00.var_1_18 [L137] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L147] RET updateLastVariables() [L148] CALL updateVariables() [L107] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L109] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L110] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L112] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L113] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L114] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L115] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L116] WrapperStruct00.var_1_9 = __VERIFIER_nondet_char() [L117] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L118] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L119] WrapperStruct00.var_1_11 = __VERIFIER_nondet_ulong() [L120] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L121] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L122] WrapperStruct00.var_1_12 = __VERIFIER_nondet_ulong() [L123] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L125] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L126] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L127] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L128] WrapperStruct00.var_1_17 = __VERIFIER_nondet_float() [L129] EXPR WrapperStruct00.var_1_17 [L129] EXPR WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L129] EXPR WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F [L129] EXPR WrapperStruct00.var_1_17 [L129] EXPR WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L129] EXPR (WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L129] EXPR (WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L129] CALL assume_abort_if_not((WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L129] RET assume_abort_if_not((WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L130] WrapperStruct00.var_1_19 = __VERIFIER_nondet_uchar() [L131] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L132] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L132] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L132] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L148] RET updateVariables() [L149] CALL step() [L81] EXPR last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L81] ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L81] ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L81] ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L81] COND FALSE !(((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) [L88] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L88] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L90] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L90] COND FALSE !((*(WrapperStruct00_var_1_5_Pointer))) [L93] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L93] COND TRUE (*(WrapperStruct00_var_1_12_Pointer)) <= (*(WrapperStruct00_var_1_8_Pointer)) [L94] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L94] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L94] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L94] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L94] (*(WrapperStruct00_var_1_14_Pointer)) = (((((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) [L96] (*(WrapperStruct00_var_1_15_Pointer)) = 2 [L97] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L97] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_17_Pointer)) [L98] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L98] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L99] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L99] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L99] unsigned char stepLocal_0 = (*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer)); [L100] stepLocal_0 && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0, stepLocal_0=0] [L100] stepLocal_0 && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L100] COND FALSE !(stepLocal_0 && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) [L103] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L103] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L103] (*(WrapperStruct00_var_1_10_Pointer)) = ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))) [L149] RET step() [L150] CALL, EXPR property() [L140] EXPR last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer)) [L140] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L140] EXPR ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR (((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) [L140] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L140] EXPR (((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR ((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR ((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1) [L140] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR (*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1 [L140] EXPR (*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR ((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR (((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - 1u)))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR (((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - 1u)))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))))) [L140] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L140] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR (((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - 1u)))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))) [L140] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L140] EXPR (((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - 1u)))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR (((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - 1u)))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR ((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - 1u)))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) <= (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR ((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - 1u)))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) <= (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) : 1) [L140] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) <= (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) : 1 [L140] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L140] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L140] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) <= (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR ((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - 1u)))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) <= (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR (((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - 1u)))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) <= (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed short int) 2)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR (((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - 1u)))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) <= (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed short int) 2)) [L140] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L140] EXPR (((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - 1u)))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) <= (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed short int) 2)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR ((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - 1u)))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) <= (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed short int) 2))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_17_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR ((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - 1u)))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) <= (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed short int) 2))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_17_Pointer)))) [L140] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L140] EXPR ((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - 1u)))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) <= (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed short int) 2))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_17_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR (((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - 1u)))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) <= (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed short int) 2))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_17_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140] EXPR (((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - 1u)))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) <= (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed short int) 2))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_17_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L140-L141] return (((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && ((((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) == (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - 1u)))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) <= (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed short int) 2))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_17_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_19_Pointer)))) ; [L150] RET, EXPR property() [L150] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_14_Pointer={4:22}, WrapperStruct00_var_1_15_Pointer={4:26}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:36}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.2s, OverallIterations: 28, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8525 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8510 mSDsluCounter, 13029 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9526 mSDsCounter, 662 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10283 IncrementalHoareTripleChecker+Invalid, 10945 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 662 mSolverCounterUnsat, 3503 mSDtfsCounter, 10283 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1479 GetRequests, 1176 SyntacticMatches, 16 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=477occurred in iteration=27, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 27 MinimizatonAttempts, 2108 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 29.9s InterpolantComputationTime, 4195 NumberOfCodeBlocks, 4195 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4016 ConstructedInterpolants, 0 QuantifiedInterpolants, 64400 SizeOfPredicates, 9 NumberOfNonLiveVariables, 554 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 28 InterpolantComputations, 26 PerfectInterpolantSequences, 15088/15232 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-19 16:24:42,346 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...