/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-34.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 16:02:35,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 16:02:35,415 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:02:35,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 16:02:35,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 16:02:35,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 16:02:35,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 16:02:35,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 16:02:35,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 16:02:35,444 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 16:02:35,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 16:02:35,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 16:02:35,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 16:02:35,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 16:02:35,446 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 16:02:35,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 16:02:35,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 16:02:35,447 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 16:02:35,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 16:02:35,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 16:02:35,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 16:02:35,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 16:02:35,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 16:02:35,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 16:02:35,449 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 16:02:35,449 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 16:02:35,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 16:02:35,449 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 16:02:35,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 16:02:35,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 16:02:35,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 16:02:35,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 16:02:35,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 16:02:35,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 16:02:35,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 16:02:35,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 16:02:35,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 16:02:35,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 16:02:35,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 16:02:35,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 16:02:35,452 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 16:02:35,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 16:02:35,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 16:02:35,452 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:02:35,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 16:02:35,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 16:02:35,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 16:02:35,661 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 16:02:35,662 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 16:02:35,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i [2023-12-19 16:02:36,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 16:02:36,922 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 16:02:36,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i [2023-12-19 16:02:36,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/046472f14/d309cd219e0640bd9c08cca947ff24e9/FLAG124f9d94d [2023-12-19 16:02:36,945 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/046472f14/d309cd219e0640bd9c08cca947ff24e9 [2023-12-19 16:02:36,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 16:02:36,948 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 16:02:36,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 16:02:36,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 16:02:36,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 16:02:36,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:02:36" (1/1) ... [2023-12-19 16:02:36,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b551a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:36, skipping insertion in model container [2023-12-19 16:02:36,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:02:36" (1/1) ... [2023-12-19 16:02:36,992 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 16:02:37,110 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i[917,930] [2023-12-19 16:02:37,170 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 16:02:37,179 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 16:02:37,196 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i[917,930] [2023-12-19 16:02:37,218 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 16:02:37,243 INFO L206 MainTranslator]: Completed translation [2023-12-19 16:02:37,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:37 WrapperNode [2023-12-19 16:02:37,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 16:02:37,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 16:02:37,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 16:02:37,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 16:02:37,249 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:02:37" (1/1) ... [2023-12-19 16:02:37,259 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:02:37" (1/1) ... [2023-12-19 16:02:37,295 INFO L138 Inliner]: procedures = 29, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 451 [2023-12-19 16:02:37,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 16:02:37,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 16:02:37,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 16:02:37,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 16:02:37,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:37" (1/1) ... [2023-12-19 16:02:37,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:37" (1/1) ... [2023-12-19 16:02:37,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:37" (1/1) ... [2023-12-19 16:02:37,326 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 18 writes are split as follows [0, 18]. [2023-12-19 16:02:37,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:37" (1/1) ... [2023-12-19 16:02:37,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:37" (1/1) ... [2023-12-19 16:02:37,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:37" (1/1) ... [2023-12-19 16:02:37,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:37" (1/1) ... [2023-12-19 16:02:37,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:37" (1/1) ... [2023-12-19 16:02:37,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:37" (1/1) ... [2023-12-19 16:02:37,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 16:02:37,366 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 16:02:37,366 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 16:02:37,366 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 16:02:37,367 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:37" (1/1) ... [2023-12-19 16:02:37,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 16:02:37,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 16:02:37,421 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:02:37,460 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:02:37,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 16:02:37,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 16:02:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 16:02:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 16:02:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 16:02:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 16:02:37,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 16:02:37,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 16:02:37,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 16:02:37,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 16:02:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 16:02:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 16:02:37,473 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 16:02:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 16:02:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 16:02:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 16:02:37,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 16:02:37,584 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 16:02:37,586 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 16:02:37,863 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 16:02:37,892 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 16:02:37,893 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 16:02:37,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:02:37 BoogieIcfgContainer [2023-12-19 16:02:37,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 16:02:37,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 16:02:37,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 16:02:37,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 16:02:37,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 04:02:36" (1/3) ... [2023-12-19 16:02:37,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73330662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:02:37, skipping insertion in model container [2023-12-19 16:02:37,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:37" (2/3) ... [2023-12-19 16:02:37,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73330662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:02:37, skipping insertion in model container [2023-12-19 16:02:37,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:02:37" (3/3) ... [2023-12-19 16:02:37,900 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-34.i [2023-12-19 16:02:37,911 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 16:02:37,912 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 16:02:37,944 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 16:02:37,948 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;@b84ca58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 16:02:37,948 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 16:02:37,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-19 16:02:37,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-12-19 16:02:37,962 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:37,963 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:37,963 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:37,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:37,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1982887210, now seen corresponding path program 1 times [2023-12-19 16:02:37,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:37,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636158993] [2023-12-19 16:02:37,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:37,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:38,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:38,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636158993] [2023-12-19 16:02:38,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636158993] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:38,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:38,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 16:02:38,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341785963] [2023-12-19 16:02:38,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:38,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 16:02:38,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:38,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 16:02:38,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 16:02:38,384 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-19 16:02:38,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:38,436 INFO L93 Difference]: Finished difference Result 223 states and 357 transitions. [2023-12-19 16:02:38,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 16:02:38,439 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2023-12-19 16:02:38,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:38,444 INFO L225 Difference]: With dead ends: 223 [2023-12-19 16:02:38,444 INFO L226 Difference]: Without dead ends: 111 [2023-12-19 16:02:38,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 16:02:38,451 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:38,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:02:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-19 16:02:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-12-19 16:02:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-19 16:02:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2023-12-19 16:02:38,496 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 166 [2023-12-19 16:02:38,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:38,497 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2023-12-19 16:02:38,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-19 16:02:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2023-12-19 16:02:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-12-19 16:02:38,500 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:38,500 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:38,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 16:02:38,500 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:38,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:38,501 INFO L85 PathProgramCache]: Analyzing trace with hash 799028980, now seen corresponding path program 1 times [2023-12-19 16:02:38,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:38,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842512387] [2023-12-19 16:02:38,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:38,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:38,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:38,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842512387] [2023-12-19 16:02:38,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842512387] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:38,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:38,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 16:02:38,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062724064] [2023-12-19 16:02:38,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:38,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 16:02:38,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:38,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 16:02:38,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:02:38,807 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:38,854 INFO L93 Difference]: Finished difference Result 222 states and 327 transitions. [2023-12-19 16:02:38,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 16:02:38,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2023-12-19 16:02:38,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:38,859 INFO L225 Difference]: With dead ends: 222 [2023-12-19 16:02:38,859 INFO L226 Difference]: Without dead ends: 112 [2023-12-19 16:02:38,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:02:38,860 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:38,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:02:38,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-19 16:02:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-12-19 16:02:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-19 16:02:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2023-12-19 16:02:38,878 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 166 [2023-12-19 16:02:38,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:38,881 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2023-12-19 16:02:38,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:38,881 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2023-12-19 16:02:38,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-12-19 16:02:38,885 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:38,885 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:38,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 16:02:38,885 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:38,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:38,886 INFO L85 PathProgramCache]: Analyzing trace with hash -889914762, now seen corresponding path program 1 times [2023-12-19 16:02:38,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:38,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016619785] [2023-12-19 16:02:38,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:38,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:39,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:39,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016619785] [2023-12-19 16:02:39,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016619785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:39,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:39,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 16:02:39,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416332177] [2023-12-19 16:02:39,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:39,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 16:02:39,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:39,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 16:02:39,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 16:02:39,197 INFO L87 Difference]: Start difference. First operand 112 states and 164 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:39,244 INFO L93 Difference]: Finished difference Result 247 states and 363 transitions. [2023-12-19 16:02:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 16:02:39,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2023-12-19 16:02:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:39,249 INFO L225 Difference]: With dead ends: 247 [2023-12-19 16:02:39,249 INFO L226 Difference]: Without dead ends: 136 [2023-12-19 16:02:39,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:02:39,254 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 61 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:39,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 487 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:02:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-19 16:02:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 114. [2023-12-19 16:02:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-19 16:02:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 166 transitions. [2023-12-19 16:02:39,266 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 166 transitions. Word has length 166 [2023-12-19 16:02:39,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:39,267 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 166 transitions. [2023-12-19 16:02:39,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 166 transitions. [2023-12-19 16:02:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-19 16:02:39,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:39,268 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:39,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 16:02:39,269 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:39,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:39,269 INFO L85 PathProgramCache]: Analyzing trace with hash -543757980, now seen corresponding path program 1 times [2023-12-19 16:02:39,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:39,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542125873] [2023-12-19 16:02:39,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:39,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:39,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:39,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542125873] [2023-12-19 16:02:39,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542125873] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:39,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:39,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 16:02:39,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961404089] [2023-12-19 16:02:39,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:39,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 16:02:39,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:39,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 16:02:39,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:02:39,438 INFO L87 Difference]: Start difference. First operand 114 states and 166 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:39,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:39,465 INFO L93 Difference]: Finished difference Result 276 states and 402 transitions. [2023-12-19 16:02:39,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 16:02:39,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 168 [2023-12-19 16:02:39,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:39,468 INFO L225 Difference]: With dead ends: 276 [2023-12-19 16:02:39,468 INFO L226 Difference]: Without dead ends: 163 [2023-12-19 16:02:39,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:02:39,471 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 56 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:39,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 309 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:02:39,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-12-19 16:02:39,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 133. [2023-12-19 16:02:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-19 16:02:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2023-12-19 16:02:39,479 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 168 [2023-12-19 16:02:39,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:39,479 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2023-12-19 16:02:39,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:39,479 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2023-12-19 16:02:39,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-19 16:02:39,481 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:39,481 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:39,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 16:02:39,481 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:39,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:39,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1410011260, now seen corresponding path program 1 times [2023-12-19 16:02:39,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:39,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569708439] [2023-12-19 16:02:39,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:39,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:39,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:39,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569708439] [2023-12-19 16:02:39,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569708439] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:39,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:39,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 16:02:39,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967055266] [2023-12-19 16:02:39,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:39,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 16:02:39,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:39,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 16:02:39,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:02:39,591 INFO L87 Difference]: Start difference. First operand 133 states and 194 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:39,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:39,609 INFO L93 Difference]: Finished difference Result 280 states and 409 transitions. [2023-12-19 16:02:39,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 16:02:39,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2023-12-19 16:02:39,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:39,611 INFO L225 Difference]: With dead ends: 280 [2023-12-19 16:02:39,611 INFO L226 Difference]: Without dead ends: 148 [2023-12-19 16:02:39,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:02:39,612 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 26 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:39,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 324 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:02:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-12-19 16:02:39,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 134. [2023-12-19 16:02:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 109 states have internal predecessors, (149), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-19 16:02:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 195 transitions. [2023-12-19 16:02:39,621 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 195 transitions. Word has length 171 [2023-12-19 16:02:39,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:39,622 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 195 transitions. [2023-12-19 16:02:39,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:39,622 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 195 transitions. [2023-12-19 16:02:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-19 16:02:39,624 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:39,624 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:39,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 16:02:39,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:39,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:39,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1151845822, now seen corresponding path program 1 times [2023-12-19 16:02:39,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:39,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903435350] [2023-12-19 16:02:39,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:39,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:40,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:40,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903435350] [2023-12-19 16:02:40,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903435350] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:40,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:40,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 16:02:40,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278150202] [2023-12-19 16:02:40,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:40,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 16:02:40,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:40,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 16:02:40,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 16:02:40,353 INFO L87 Difference]: Start difference. First operand 134 states and 195 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:40,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:40,615 INFO L93 Difference]: Finished difference Result 334 states and 483 transitions. [2023-12-19 16:02:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 16:02:40,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2023-12-19 16:02:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:40,618 INFO L225 Difference]: With dead ends: 334 [2023-12-19 16:02:40,618 INFO L226 Difference]: Without dead ends: 201 [2023-12-19 16:02:40,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-12-19 16:02:40,620 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 165 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:40,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1040 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:02:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-19 16:02:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 163. [2023-12-19 16:02:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.3695652173913044) internal successors, (189), 138 states have internal predecessors, (189), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-19 16:02:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 235 transitions. [2023-12-19 16:02:40,628 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 235 transitions. Word has length 171 [2023-12-19 16:02:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:40,628 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 235 transitions. [2023-12-19 16:02:40,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 235 transitions. [2023-12-19 16:02:40,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-19 16:02:40,629 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:40,629 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:40,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 16:02:40,630 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:40,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:40,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1544872832, now seen corresponding path program 1 times [2023-12-19 16:02:40,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:40,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840531097] [2023-12-19 16:02:40,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:41,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:41,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840531097] [2023-12-19 16:02:41,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840531097] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:41,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:41,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 16:02:41,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124603583] [2023-12-19 16:02:41,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:41,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 16:02:41,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:41,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 16:02:41,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-19 16:02:41,323 INFO L87 Difference]: Start difference. First operand 163 states and 235 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-19 16:02:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:41,719 INFO L93 Difference]: Finished difference Result 377 states and 542 transitions. [2023-12-19 16:02:41,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:02:41,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2023-12-19 16:02:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:41,721 INFO L225 Difference]: With dead ends: 377 [2023-12-19 16:02:41,721 INFO L226 Difference]: Without dead ends: 215 [2023-12-19 16:02:41,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-19 16:02:41,722 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 281 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:41,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 417 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:02:41,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-19 16:02:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 163. [2023-12-19 16:02:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.3623188405797102) internal successors, (188), 138 states have internal predecessors, (188), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-19 16:02:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 234 transitions. [2023-12-19 16:02:41,730 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 234 transitions. Word has length 171 [2023-12-19 16:02:41,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:41,732 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 234 transitions. [2023-12-19 16:02:41,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-19 16:02:41,732 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 234 transitions. [2023-12-19 16:02:41,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-19 16:02:41,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:41,734 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:41,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 16:02:41,734 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:41,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:41,734 INFO L85 PathProgramCache]: Analyzing trace with hash -932991104, now seen corresponding path program 1 times [2023-12-19 16:02:41,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:41,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273035639] [2023-12-19 16:02:41,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:41,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:42,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:42,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273035639] [2023-12-19 16:02:42,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273035639] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:42,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:42,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 16:02:42,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090670623] [2023-12-19 16:02:42,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:42,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 16:02:42,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:42,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 16:02:42,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-19 16:02:42,285 INFO L87 Difference]: Start difference. First operand 163 states and 234 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-19 16:02:42,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:42,626 INFO L93 Difference]: Finished difference Result 375 states and 538 transitions. [2023-12-19 16:02:42,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 16:02:42,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2023-12-19 16:02:42,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:42,628 INFO L225 Difference]: With dead ends: 375 [2023-12-19 16:02:42,628 INFO L226 Difference]: Without dead ends: 213 [2023-12-19 16:02:42,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-19 16:02:42,629 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 183 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:42,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 462 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:02:42,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-12-19 16:02:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 186. [2023-12-19 16:02:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-19 16:02:42,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 267 transitions. [2023-12-19 16:02:42,636 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 267 transitions. Word has length 171 [2023-12-19 16:02:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:42,636 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 267 transitions. [2023-12-19 16:02:42,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-19 16:02:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 267 transitions. [2023-12-19 16:02:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-19 16:02:42,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:42,638 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:42,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 16:02:42,638 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:42,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:42,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1326018114, now seen corresponding path program 1 times [2023-12-19 16:02:42,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:42,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848881607] [2023-12-19 16:02:42,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:42,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:43,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:43,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848881607] [2023-12-19 16:02:43,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848881607] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:43,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:43,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 16:02:43,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059897724] [2023-12-19 16:02:43,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:43,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 16:02:43,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:43,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 16:02:43,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:02:43,687 INFO L87 Difference]: Start difference. First operand 186 states and 267 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:44,376 INFO L93 Difference]: Finished difference Result 412 states and 590 transitions. [2023-12-19 16:02:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 16:02:44,376 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2023-12-19 16:02:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:44,377 INFO L225 Difference]: With dead ends: 412 [2023-12-19 16:02:44,377 INFO L226 Difference]: Without dead ends: 227 [2023-12-19 16:02:44,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-12-19 16:02:44,378 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 259 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:44,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1127 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 16:02:44,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-12-19 16:02:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 186. [2023-12-19 16:02:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-19 16:02:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 267 transitions. [2023-12-19 16:02:44,386 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 267 transitions. Word has length 171 [2023-12-19 16:02:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:44,386 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 267 transitions. [2023-12-19 16:02:44,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:44,387 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 267 transitions. [2023-12-19 16:02:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-19 16:02:44,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:44,388 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:44,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 16:02:44,388 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:44,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:44,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1450268400, now seen corresponding path program 1 times [2023-12-19 16:02:44,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:44,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214432965] [2023-12-19 16:02:44,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:44,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:44,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:44,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214432965] [2023-12-19 16:02:44,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214432965] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:44,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:44,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 16:02:44,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948405714] [2023-12-19 16:02:44,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:44,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 16:02:44,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:44,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 16:02:44,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:02:44,482 INFO L87 Difference]: Start difference. First operand 186 states and 267 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:44,505 INFO L93 Difference]: Finished difference Result 409 states and 586 transitions. [2023-12-19 16:02:44,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 16:02:44,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2023-12-19 16:02:44,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:44,507 INFO L225 Difference]: With dead ends: 409 [2023-12-19 16:02:44,507 INFO L226 Difference]: Without dead ends: 224 [2023-12-19 16:02:44,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:02:44,508 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 60 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:44,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 361 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:02:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-12-19 16:02:44,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 186. [2023-12-19 16:02:44,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.329192546583851) internal successors, (214), 161 states have internal predecessors, (214), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-19 16:02:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 260 transitions. [2023-12-19 16:02:44,516 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 260 transitions. Word has length 171 [2023-12-19 16:02:44,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:44,517 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 260 transitions. [2023-12-19 16:02:44,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 260 transitions. [2023-12-19 16:02:44,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-19 16:02:44,518 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:44,518 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:44,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 16:02:44,518 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:44,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:44,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1097966277, now seen corresponding path program 1 times [2023-12-19 16:02:44,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:44,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002657039] [2023-12-19 16:02:44,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:44,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:44,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:44,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002657039] [2023-12-19 16:02:44,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002657039] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:44,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:44,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 16:02:44,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317654873] [2023-12-19 16:02:44,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:44,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 16:02:44,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:44,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 16:02:44,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:02:44,854 INFO L87 Difference]: Start difference. First operand 186 states and 260 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:45,136 INFO L93 Difference]: Finished difference Result 436 states and 608 transitions. [2023-12-19 16:02:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 16:02:45,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 172 [2023-12-19 16:02:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:45,138 INFO L225 Difference]: With dead ends: 436 [2023-12-19 16:02:45,138 INFO L226 Difference]: Without dead ends: 251 [2023-12-19 16:02:45,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:02:45,139 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 190 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:45,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 581 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:02:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-12-19 16:02:45,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 199. [2023-12-19 16:02:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 174 states have (on average 1.3218390804597702) internal successors, (230), 174 states have internal predecessors, (230), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-19 16:02:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 276 transitions. [2023-12-19 16:02:45,150 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 276 transitions. Word has length 172 [2023-12-19 16:02:45,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:45,150 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 276 transitions. [2023-12-19 16:02:45,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:45,150 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 276 transitions. [2023-12-19 16:02:45,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-19 16:02:45,152 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:45,152 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:45,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 16:02:45,153 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:45,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:45,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1774683992, now seen corresponding path program 1 times [2023-12-19 16:02:45,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:45,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080297558] [2023-12-19 16:02:45,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:45,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:45,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:45,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080297558] [2023-12-19 16:02:45,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080297558] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:45,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:45,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 16:02:45,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268883091] [2023-12-19 16:02:45,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:45,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 16:02:45,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:45,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 16:02:45,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:02:45,576 INFO L87 Difference]: Start difference. First operand 199 states and 276 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:45,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:45,895 INFO L93 Difference]: Finished difference Result 480 states and 667 transitions. [2023-12-19 16:02:45,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:02:45,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-12-19 16:02:45,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:45,897 INFO L225 Difference]: With dead ends: 480 [2023-12-19 16:02:45,897 INFO L226 Difference]: Without dead ends: 282 [2023-12-19 16:02:45,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:02:45,898 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 203 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:45,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 565 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:02:45,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-12-19 16:02:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 228. [2023-12-19 16:02:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3251231527093597) internal successors, (269), 203 states have internal predecessors, (269), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-19 16:02:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 315 transitions. [2023-12-19 16:02:45,910 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 315 transitions. Word has length 173 [2023-12-19 16:02:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:45,911 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 315 transitions. [2023-12-19 16:02:45,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 315 transitions. [2023-12-19 16:02:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-19 16:02:45,912 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:45,912 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:45,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 16:02:45,912 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:45,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:45,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1836723606, now seen corresponding path program 1 times [2023-12-19 16:02:45,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:45,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730299646] [2023-12-19 16:02:45,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:45,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:46,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:46,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730299646] [2023-12-19 16:02:46,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730299646] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:46,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:46,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 16:02:46,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063890595] [2023-12-19 16:02:46,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:46,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 16:02:46,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:46,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 16:02:46,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-19 16:02:46,326 INFO L87 Difference]: Start difference. First operand 228 states and 315 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:46,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:46,625 INFO L93 Difference]: Finished difference Result 519 states and 717 transitions. [2023-12-19 16:02:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 16:02:46,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-12-19 16:02:46,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:46,627 INFO L225 Difference]: With dead ends: 519 [2023-12-19 16:02:46,627 INFO L226 Difference]: Without dead ends: 292 [2023-12-19 16:02:46,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-19 16:02:46,628 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 276 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:46,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 574 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:02:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-12-19 16:02:46,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 212. [2023-12-19 16:02:46,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 187 states have (on average 1.3262032085561497) internal successors, (248), 187 states have internal predecessors, (248), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-19 16:02:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2023-12-19 16:02:46,641 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 173 [2023-12-19 16:02:46,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:46,644 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2023-12-19 16:02:46,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:46,644 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2023-12-19 16:02:46,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-19 16:02:46,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:46,645 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:46,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 16:02:46,646 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:46,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:46,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1098401000, now seen corresponding path program 1 times [2023-12-19 16:02:46,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:46,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083873332] [2023-12-19 16:02:46,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:46,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:46,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:47,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:47,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083873332] [2023-12-19 16:02:47,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083873332] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:47,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:47,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 16:02:47,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188621939] [2023-12-19 16:02:47,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:47,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 16:02:47,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:47,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 16:02:47,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:02:47,023 INFO L87 Difference]: Start difference. First operand 212 states and 294 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:47,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:47,313 INFO L93 Difference]: Finished difference Result 473 states and 655 transitions. [2023-12-19 16:02:47,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 16:02:47,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-12-19 16:02:47,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:47,314 INFO L225 Difference]: With dead ends: 473 [2023-12-19 16:02:47,315 INFO L226 Difference]: Without dead ends: 262 [2023-12-19 16:02:47,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-19 16:02:47,315 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 261 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:47,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 424 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:02:47,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-12-19 16:02:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 225. [2023-12-19 16:02:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 200 states have (on average 1.305) internal successors, (261), 200 states have internal predecessors, (261), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-19 16:02:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 307 transitions. [2023-12-19 16:02:47,326 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 307 transitions. Word has length 173 [2023-12-19 16:02:47,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:47,326 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 307 transitions. [2023-12-19 16:02:47,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 307 transitions. [2023-12-19 16:02:47,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-19 16:02:47,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:47,328 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:47,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 16:02:47,328 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:47,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:47,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2109518250, now seen corresponding path program 1 times [2023-12-19 16:02:47,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:47,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950325317] [2023-12-19 16:02:47,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:47,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:47,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:47,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950325317] [2023-12-19 16:02:47,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950325317] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:47,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:47,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 16:02:47,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171363151] [2023-12-19 16:02:47,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:47,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 16:02:47,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:47,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 16:02:47,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-19 16:02:47,690 INFO L87 Difference]: Start difference. First operand 225 states and 307 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:47,952 INFO L93 Difference]: Finished difference Result 478 states and 653 transitions. [2023-12-19 16:02:47,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:02:47,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-12-19 16:02:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:47,954 INFO L225 Difference]: With dead ends: 478 [2023-12-19 16:02:47,954 INFO L226 Difference]: Without dead ends: 254 [2023-12-19 16:02:47,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:02:47,956 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 246 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:47,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 427 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:02:47,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-19 16:02:47,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 225. [2023-12-19 16:02:47,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 200 states have (on average 1.275) internal successors, (255), 200 states have internal predecessors, (255), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-19 16:02:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 301 transitions. [2023-12-19 16:02:47,966 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 301 transitions. Word has length 173 [2023-12-19 16:02:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:47,967 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 301 transitions. [2023-12-19 16:02:47,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 301 transitions. [2023-12-19 16:02:47,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-19 16:02:47,968 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:47,969 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:47,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-19 16:02:47,970 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:47,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1817118025, now seen corresponding path program 1 times [2023-12-19 16:02:47,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:47,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190693650] [2023-12-19 16:02:47,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:47,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:48,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:48,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190693650] [2023-12-19 16:02:48,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190693650] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:48,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:48,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 16:02:48,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979630497] [2023-12-19 16:02:48,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:48,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 16:02:48,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:48,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 16:02:48,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:02:48,131 INFO L87 Difference]: Start difference. First operand 225 states and 301 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:48,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:48,173 INFO L93 Difference]: Finished difference Result 455 states and 609 transitions. [2023-12-19 16:02:48,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 16:02:48,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-12-19 16:02:48,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:48,174 INFO L225 Difference]: With dead ends: 455 [2023-12-19 16:02:48,174 INFO L226 Difference]: Without dead ends: 231 [2023-12-19 16:02:48,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:02:48,175 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 24 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:48,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 599 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:02:48,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-12-19 16:02:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2023-12-19 16:02:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.270935960591133) internal successors, (258), 203 states have internal predecessors, (258), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-19 16:02:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 304 transitions. [2023-12-19 16:02:48,189 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 304 transitions. Word has length 173 [2023-12-19 16:02:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:48,189 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 304 transitions. [2023-12-19 16:02:48,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 304 transitions. [2023-12-19 16:02:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-19 16:02:48,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:48,191 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:48,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 16:02:48,191 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:48,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:48,191 INFO L85 PathProgramCache]: Analyzing trace with hash 799532139, now seen corresponding path program 1 times [2023-12-19 16:02:48,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:48,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424240201] [2023-12-19 16:02:48,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:48,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:48,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:48,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424240201] [2023-12-19 16:02:48,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424240201] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:48,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:48,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 16:02:48,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183932872] [2023-12-19 16:02:48,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:48,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 16:02:48,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:48,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 16:02:48,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 16:02:48,358 INFO L87 Difference]: Start difference. First operand 228 states and 304 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:48,536 INFO L93 Difference]: Finished difference Result 621 states and 830 transitions. [2023-12-19 16:02:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 16:02:48,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-12-19 16:02:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:48,538 INFO L225 Difference]: With dead ends: 621 [2023-12-19 16:02:48,538 INFO L226 Difference]: Without dead ends: 394 [2023-12-19 16:02:48,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:02:48,539 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 113 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:48,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 385 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 16:02:48,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-12-19 16:02:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 285. [2023-12-19 16:02:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 236 states have (on average 1.2457627118644068) internal successors, (294), 236 states have internal predecessors, (294), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:02:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 386 transitions. [2023-12-19 16:02:48,560 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 386 transitions. Word has length 173 [2023-12-19 16:02:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:48,561 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 386 transitions. [2023-12-19 16:02:48,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 386 transitions. [2023-12-19 16:02:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-19 16:02:48,562 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:48,562 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:48,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 16:02:48,562 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:48,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:48,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1906828626, now seen corresponding path program 1 times [2023-12-19 16:02:48,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:48,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677411839] [2023-12-19 16:02:48,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:48,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:48,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:48,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677411839] [2023-12-19 16:02:48,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677411839] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:48,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:48,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 16:02:48,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775986621] [2023-12-19 16:02:48,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:48,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 16:02:48,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:48,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 16:02:48,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:02:48,967 INFO L87 Difference]: Start difference. First operand 285 states and 386 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:49,239 INFO L93 Difference]: Finished difference Result 621 states and 832 transitions. [2023-12-19 16:02:49,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 16:02:49,240 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-19 16:02:49,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:49,241 INFO L225 Difference]: With dead ends: 621 [2023-12-19 16:02:49,241 INFO L226 Difference]: Without dead ends: 394 [2023-12-19 16:02:49,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2023-12-19 16:02:49,242 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 194 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:49,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1425 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:02:49,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-12-19 16:02:49,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 336. [2023-12-19 16:02:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 287 states have (on average 1.2508710801393728) internal successors, (359), 287 states have internal predecessors, (359), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:02:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 451 transitions. [2023-12-19 16:02:49,281 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 451 transitions. Word has length 175 [2023-12-19 16:02:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:49,281 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 451 transitions. [2023-12-19 16:02:49,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 451 transitions. [2023-12-19 16:02:49,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-19 16:02:49,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:49,283 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:49,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-19 16:02:49,283 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:49,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:49,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1995111660, now seen corresponding path program 1 times [2023-12-19 16:02:49,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:49,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180531488] [2023-12-19 16:02:49,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:49,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:49,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:49,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180531488] [2023-12-19 16:02:49,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180531488] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:49,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:49,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 16:02:49,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296025133] [2023-12-19 16:02:49,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:49,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 16:02:49,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:49,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 16:02:49,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 16:02:49,361 INFO L87 Difference]: Start difference. First operand 336 states and 451 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:49,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:49,396 INFO L93 Difference]: Finished difference Result 661 states and 880 transitions. [2023-12-19 16:02:49,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 16:02:49,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-19 16:02:49,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:49,397 INFO L225 Difference]: With dead ends: 661 [2023-12-19 16:02:49,397 INFO L226 Difference]: Without dead ends: 383 [2023-12-19 16:02:49,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:02:49,398 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 63 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:49,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 495 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:02:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2023-12-19 16:02:49,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 340. [2023-12-19 16:02:49,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 291 states have (on average 1.2474226804123711) internal successors, (363), 291 states have internal predecessors, (363), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:02:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 455 transitions. [2023-12-19 16:02:49,415 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 455 transitions. Word has length 175 [2023-12-19 16:02:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:49,416 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 455 transitions. [2023-12-19 16:02:49,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 455 transitions. [2023-12-19 16:02:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-19 16:02:49,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:49,417 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:49,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-19 16:02:49,417 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:49,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:49,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2041690198, now seen corresponding path program 1 times [2023-12-19 16:02:49,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:49,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971595120] [2023-12-19 16:02:49,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:49,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:49,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:49,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971595120] [2023-12-19 16:02:49,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971595120] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:49,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:49,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 16:02:49,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204442253] [2023-12-19 16:02:49,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:49,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 16:02:49,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:49,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 16:02:49,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 16:02:49,655 INFO L87 Difference]: Start difference. First operand 340 states and 455 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:49,813 INFO L93 Difference]: Finished difference Result 718 states and 950 transitions. [2023-12-19 16:02:49,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 16:02:49,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-19 16:02:49,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:49,815 INFO L225 Difference]: With dead ends: 718 [2023-12-19 16:02:49,815 INFO L226 Difference]: Without dead ends: 436 [2023-12-19 16:02:49,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-19 16:02:49,816 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 167 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:49,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 570 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 16:02:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2023-12-19 16:02:49,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 344. [2023-12-19 16:02:49,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 295 states have (on average 1.2508474576271187) internal successors, (369), 295 states have internal predecessors, (369), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:02:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 461 transitions. [2023-12-19 16:02:49,837 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 461 transitions. Word has length 175 [2023-12-19 16:02:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:49,838 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 461 transitions. [2023-12-19 16:02:49,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 461 transitions. [2023-12-19 16:02:49,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-19 16:02:49,839 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:49,839 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:49,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-19 16:02:49,839 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:49,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:49,839 INFO L85 PathProgramCache]: Analyzing trace with hash -2040842132, now seen corresponding path program 1 times [2023-12-19 16:02:49,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:49,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375291430] [2023-12-19 16:02:49,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:49,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:49,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:49,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375291430] [2023-12-19 16:02:49,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375291430] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:49,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:49,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 16:02:49,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050125207] [2023-12-19 16:02:49,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:49,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 16:02:49,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:49,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 16:02:49,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 16:02:49,927 INFO L87 Difference]: Start difference. First operand 344 states and 461 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:49,957 INFO L93 Difference]: Finished difference Result 642 states and 855 transitions. [2023-12-19 16:02:49,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 16:02:49,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-19 16:02:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:49,959 INFO L225 Difference]: With dead ends: 642 [2023-12-19 16:02:49,959 INFO L226 Difference]: Without dead ends: 356 [2023-12-19 16:02:49,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:02:49,961 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 3 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:49,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 457 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:02:49,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-12-19 16:02:49,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 352. [2023-12-19 16:02:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 303 states have (on average 1.2442244224422443) internal successors, (377), 303 states have internal predecessors, (377), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:02:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 469 transitions. [2023-12-19 16:02:49,976 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 469 transitions. Word has length 175 [2023-12-19 16:02:49,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:49,976 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 469 transitions. [2023-12-19 16:02:49,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 469 transitions. [2023-12-19 16:02:49,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-19 16:02:49,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:49,978 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:49,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-19 16:02:49,978 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:49,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:49,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1978802518, now seen corresponding path program 1 times [2023-12-19 16:02:49,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:49,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568020724] [2023-12-19 16:02:49,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:49,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:50,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:50,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568020724] [2023-12-19 16:02:50,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568020724] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:50,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:50,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 16:02:50,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388697858] [2023-12-19 16:02:50,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:50,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 16:02:50,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:50,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 16:02:50,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 16:02:50,201 INFO L87 Difference]: Start difference. First operand 352 states and 469 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:50,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:50,345 INFO L93 Difference]: Finished difference Result 654 states and 865 transitions. [2023-12-19 16:02:50,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 16:02:50,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-19 16:02:50,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:50,347 INFO L225 Difference]: With dead ends: 654 [2023-12-19 16:02:50,347 INFO L226 Difference]: Without dead ends: 360 [2023-12-19 16:02:50,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-19 16:02:50,348 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 110 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:50,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 614 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 16:02:50,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-12-19 16:02:50,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 325. [2023-12-19 16:02:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 276 states have (on average 1.2391304347826086) internal successors, (342), 276 states have internal predecessors, (342), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:02:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 434 transitions. [2023-12-19 16:02:50,378 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 434 transitions. Word has length 175 [2023-12-19 16:02:50,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:50,378 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 434 transitions. [2023-12-19 16:02:50,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 434 transitions. [2023-12-19 16:02:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-19 16:02:50,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:50,379 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:50,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-19 16:02:50,380 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:50,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash 732686758, now seen corresponding path program 1 times [2023-12-19 16:02:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:50,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315808755] [2023-12-19 16:02:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:50,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:50,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:50,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315808755] [2023-12-19 16:02:50,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315808755] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:50,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:50,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 16:02:50,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408407475] [2023-12-19 16:02:50,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:50,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 16:02:50,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:50,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 16:02:50,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:02:50,687 INFO L87 Difference]: Start difference. First operand 325 states and 434 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:50,989 INFO L93 Difference]: Finished difference Result 715 states and 941 transitions. [2023-12-19 16:02:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:02:50,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-19 16:02:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:50,991 INFO L225 Difference]: With dead ends: 715 [2023-12-19 16:02:50,991 INFO L226 Difference]: Without dead ends: 448 [2023-12-19 16:02:50,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:02:50,992 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 213 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:50,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 551 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:02:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-12-19 16:02:51,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 377. [2023-12-19 16:02:51,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 328 states have (on average 1.2378048780487805) internal successors, (406), 328 states have internal predecessors, (406), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:02:51,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 498 transitions. [2023-12-19 16:02:51,020 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 498 transitions. Word has length 175 [2023-12-19 16:02:51,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:51,020 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 498 transitions. [2023-12-19 16:02:51,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:51,021 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 498 transitions. [2023-12-19 16:02:51,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-19 16:02:51,021 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:51,021 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:51,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-19 16:02:51,022 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:51,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:51,022 INFO L85 PathProgramCache]: Analyzing trace with hash 794726372, now seen corresponding path program 1 times [2023-12-19 16:02:51,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:51,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664888442] [2023-12-19 16:02:51,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:51,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:51,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:51,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664888442] [2023-12-19 16:02:51,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664888442] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:51,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:51,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 16:02:51,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78572766] [2023-12-19 16:02:51,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:51,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 16:02:51,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:51,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 16:02:51,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 16:02:51,286 INFO L87 Difference]: Start difference. First operand 377 states and 498 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:51,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:51,381 INFO L93 Difference]: Finished difference Result 669 states and 878 transitions. [2023-12-19 16:02:51,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 16:02:51,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-19 16:02:51,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:51,383 INFO L225 Difference]: With dead ends: 669 [2023-12-19 16:02:51,384 INFO L226 Difference]: Without dead ends: 350 [2023-12-19 16:02:51,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 16:02:51,384 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 19 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:51,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 547 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 16:02:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2023-12-19 16:02:51,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2023-12-19 16:02:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 301 states have (on average 1.2259136212624584) internal successors, (369), 301 states have internal predecessors, (369), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:02:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 461 transitions. [2023-12-19 16:02:51,401 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 461 transitions. Word has length 175 [2023-12-19 16:02:51,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:51,401 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 461 transitions. [2023-12-19 16:02:51,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:51,401 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 461 transitions. [2023-12-19 16:02:51,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-19 16:02:51,402 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:51,402 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:51,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-19 16:02:51,402 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:51,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:51,402 INFO L85 PathProgramCache]: Analyzing trace with hash 795574438, now seen corresponding path program 1 times [2023-12-19 16:02:51,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:51,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806485980] [2023-12-19 16:02:51,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:51,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:51,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:51,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806485980] [2023-12-19 16:02:51,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806485980] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:51,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:51,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 16:02:51,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740143615] [2023-12-19 16:02:51,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:51,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 16:02:51,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:51,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 16:02:51,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-19 16:02:51,762 INFO L87 Difference]: Start difference. First operand 350 states and 461 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-19 16:02:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:51,974 INFO L93 Difference]: Finished difference Result 677 states and 884 transitions. [2023-12-19 16:02:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 16:02:51,975 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2023-12-19 16:02:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:51,976 INFO L225 Difference]: With dead ends: 677 [2023-12-19 16:02:51,976 INFO L226 Difference]: Without dead ends: 385 [2023-12-19 16:02:51,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-19 16:02:51,977 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 265 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:51,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 397 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:02:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-12-19 16:02:52,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 352. [2023-12-19 16:02:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 303 states have (on average 1.221122112211221) internal successors, (370), 303 states have internal predecessors, (370), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:02:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 462 transitions. [2023-12-19 16:02:52,006 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 462 transitions. Word has length 175 [2023-12-19 16:02:52,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:52,006 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 462 transitions. [2023-12-19 16:02:52,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-19 16:02:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 462 transitions. [2023-12-19 16:02:52,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-19 16:02:52,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:52,007 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:52,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-19 16:02:52,007 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:52,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:52,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1053739876, now seen corresponding path program 1 times [2023-12-19 16:02:52,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:52,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473755808] [2023-12-19 16:02:52,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:52,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:52,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:52,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473755808] [2023-12-19 16:02:52,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473755808] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:52,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:52,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 16:02:52,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915529566] [2023-12-19 16:02:52,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:52,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 16:02:52,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:52,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 16:02:52,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 16:02:52,205 INFO L87 Difference]: Start difference. First operand 352 states and 462 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:52,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:52,324 INFO L93 Difference]: Finished difference Result 713 states and 926 transitions. [2023-12-19 16:02:52,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 16:02:52,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-19 16:02:52,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:52,325 INFO L225 Difference]: With dead ends: 713 [2023-12-19 16:02:52,325 INFO L226 Difference]: Without dead ends: 419 [2023-12-19 16:02:52,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 16:02:52,326 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 114 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:52,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 563 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 16:02:52,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-19 16:02:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 352. [2023-12-19 16:02:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 303 states have (on average 1.2178217821782178) internal successors, (369), 303 states have internal predecessors, (369), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:02:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 461 transitions. [2023-12-19 16:02:52,342 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 461 transitions. Word has length 175 [2023-12-19 16:02:52,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:52,343 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 461 transitions. [2023-12-19 16:02:52,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 461 transitions. [2023-12-19 16:02:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-19 16:02:52,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:52,344 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:52,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-19 16:02:52,344 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:52,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:52,344 INFO L85 PathProgramCache]: Analyzing trace with hash 660712866, now seen corresponding path program 1 times [2023-12-19 16:02:52,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:52,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296859797] [2023-12-19 16:02:52,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:52,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:54,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:54,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296859797] [2023-12-19 16:02:54,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296859797] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:54,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:54,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-19 16:02:54,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499453668] [2023-12-19 16:02:54,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:54,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-19 16:02:54,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:54,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-19 16:02:54,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-12-19 16:02:54,032 INFO L87 Difference]: Start difference. First operand 352 states and 461 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2023-12-19 16:02:55,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:55,202 INFO L93 Difference]: Finished difference Result 689 states and 896 transitions. [2023-12-19 16:02:55,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 16:02:55,202 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) Word has length 175 [2023-12-19 16:02:55,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:55,204 INFO L225 Difference]: With dead ends: 689 [2023-12-19 16:02:55,204 INFO L226 Difference]: Without dead ends: 395 [2023-12-19 16:02:55,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2023-12-19 16:02:55,205 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 356 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:55,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1044 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 16:02:55,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2023-12-19 16:02:55,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 354. [2023-12-19 16:02:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 305 states have (on average 1.2163934426229508) internal successors, (371), 305 states have internal predecessors, (371), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:02:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 463 transitions. [2023-12-19 16:02:55,233 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 463 transitions. Word has length 175 [2023-12-19 16:02:55,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:55,233 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 463 transitions. [2023-12-19 16:02:55,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2023-12-19 16:02:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 463 transitions. [2023-12-19 16:02:55,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-19 16:02:55,234 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:55,235 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:55,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-19 16:02:55,235 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:55,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:55,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1472294428, now seen corresponding path program 1 times [2023-12-19 16:02:55,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:55,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468130379] [2023-12-19 16:02:55,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:55,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:55,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:55,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468130379] [2023-12-19 16:02:55,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468130379] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:55,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:55,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 16:02:55,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947523498] [2023-12-19 16:02:55,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:55,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 16:02:55,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:55,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 16:02:55,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-19 16:02:55,746 INFO L87 Difference]: Start difference. First operand 354 states and 463 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:56,038 INFO L93 Difference]: Finished difference Result 571 states and 731 transitions. [2023-12-19 16:02:56,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 16:02:56,039 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-12-19 16:02:56,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:56,041 INFO L225 Difference]: With dead ends: 571 [2023-12-19 16:02:56,041 INFO L226 Difference]: Without dead ends: 569 [2023-12-19 16:02:56,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-19 16:02:56,041 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 285 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:56,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 563 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:02:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2023-12-19 16:02:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 558. [2023-12-19 16:02:56,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 509 states have (on average 1.223968565815324) internal successors, (623), 509 states have internal predecessors, (623), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:02:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 715 transitions. [2023-12-19 16:02:56,074 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 715 transitions. Word has length 175 [2023-12-19 16:02:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:56,074 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 715 transitions. [2023-12-19 16:02:56,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 715 transitions. [2023-12-19 16:02:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-19 16:02:56,075 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:56,075 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:56,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-19 16:02:56,075 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:56,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:56,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1494926682, now seen corresponding path program 1 times [2023-12-19 16:02:56,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:56,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156503017] [2023-12-19 16:02:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:56,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:56,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156503017] [2023-12-19 16:02:56,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156503017] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:56,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:56,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 16:02:56,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915334279] [2023-12-19 16:02:56,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:56,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 16:02:56,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:56,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 16:02:56,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:02:56,624 INFO L87 Difference]: Start difference. First operand 558 states and 715 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-19 16:02:56,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:56,752 INFO L93 Difference]: Finished difference Result 1078 states and 1372 transitions. [2023-12-19 16:02:56,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 16:02:56,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2023-12-19 16:02:56,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:56,754 INFO L225 Difference]: With dead ends: 1078 [2023-12-19 16:02:56,754 INFO L226 Difference]: Without dead ends: 578 [2023-12-19 16:02:56,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-19 16:02:56,755 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 63 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:56,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 366 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 16:02:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2023-12-19 16:02:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 563. [2023-12-19 16:02:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 514 states have (on average 1.2256809338521402) internal successors, (630), 514 states have internal predecessors, (630), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:02:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 722 transitions. [2023-12-19 16:02:56,780 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 722 transitions. Word has length 175 [2023-12-19 16:02:56,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:56,780 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 722 transitions. [2023-12-19 16:02:56,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-19 16:02:56,780 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 722 transitions. [2023-12-19 16:02:56,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-19 16:02:56,781 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:56,781 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:56,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-19 16:02:56,781 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:56,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:56,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1311023621, now seen corresponding path program 1 times [2023-12-19 16:02:56,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:56,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869094895] [2023-12-19 16:02:56,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:56,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:57,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:57,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869094895] [2023-12-19 16:02:57,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869094895] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:57,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:57,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-19 16:02:57,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790905818] [2023-12-19 16:02:57,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:57,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-19 16:02:57,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:57,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-19 16:02:57,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-12-19 16:02:57,261 INFO L87 Difference]: Start difference. First operand 563 states and 722 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:57,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:57,673 INFO L93 Difference]: Finished difference Result 1184 states and 1511 transitions. [2023-12-19 16:02:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 16:02:57,676 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2023-12-19 16:02:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:57,678 INFO L225 Difference]: With dead ends: 1184 [2023-12-19 16:02:57,678 INFO L226 Difference]: Without dead ends: 684 [2023-12-19 16:02:57,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2023-12-19 16:02:57,679 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 406 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:57,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1002 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:02:57,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2023-12-19 16:02:57,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 582. [2023-12-19 16:02:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 533 states have (on average 1.2307692307692308) internal successors, (656), 533 states have internal predecessors, (656), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:02:57,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 748 transitions. [2023-12-19 16:02:57,705 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 748 transitions. Word has length 176 [2023-12-19 16:02:57,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:57,705 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 748 transitions. [2023-12-19 16:02:57,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:57,706 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 748 transitions. [2023-12-19 16:02:57,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-19 16:02:57,706 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:57,706 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:57,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-19 16:02:57,707 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:57,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:57,707 INFO L85 PathProgramCache]: Analyzing trace with hash 165044799, now seen corresponding path program 1 times [2023-12-19 16:02:57,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:57,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996292744] [2023-12-19 16:02:57,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:57,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:58,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:58,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996292744] [2023-12-19 16:02:58,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996292744] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:58,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:58,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 16:02:58,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705554370] [2023-12-19 16:02:58,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:58,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 16:02:58,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:58,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 16:02:58,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-19 16:02:58,146 INFO L87 Difference]: Start difference. First operand 582 states and 748 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-19 16:02:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:58,484 INFO L93 Difference]: Finished difference Result 1226 states and 1566 transitions. [2023-12-19 16:02:58,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:02:58,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 176 [2023-12-19 16:02:58,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:58,487 INFO L225 Difference]: With dead ends: 1226 [2023-12-19 16:02:58,487 INFO L226 Difference]: Without dead ends: 707 [2023-12-19 16:02:58,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-19 16:02:58,489 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 287 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:58,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 429 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:02:58,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2023-12-19 16:02:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 597. [2023-12-19 16:02:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 548 states have (on average 1.2335766423357664) internal successors, (676), 548 states have internal predecessors, (676), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:02:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 768 transitions. [2023-12-19 16:02:58,520 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 768 transitions. Word has length 176 [2023-12-19 16:02:58,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:58,521 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 768 transitions. [2023-12-19 16:02:58,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-19 16:02:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 768 transitions. [2023-12-19 16:02:58,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-19 16:02:58,522 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:58,522 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:58,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-19 16:02:58,522 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:58,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:58,522 INFO L85 PathProgramCache]: Analyzing trace with hash 2088272833, now seen corresponding path program 1 times [2023-12-19 16:02:58,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:58,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244581681] [2023-12-19 16:02:58,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:58,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:58,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:58,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244581681] [2023-12-19 16:02:58,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244581681] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:58,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:58,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 16:02:58,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650346942] [2023-12-19 16:02:58,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:58,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 16:02:58,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:59,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 16:02:59,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:02:59,000 INFO L87 Difference]: Start difference. First operand 597 states and 768 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:59,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:59,324 INFO L93 Difference]: Finished difference Result 1263 states and 1615 transitions. [2023-12-19 16:02:59,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:02:59,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2023-12-19 16:02:59,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:59,329 INFO L225 Difference]: With dead ends: 1263 [2023-12-19 16:02:59,329 INFO L226 Difference]: Without dead ends: 729 [2023-12-19 16:02:59,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-19 16:02:59,333 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 214 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:59,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 532 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:02:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2023-12-19 16:02:59,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 597. [2023-12-19 16:02:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 548 states have (on average 1.2335766423357664) internal successors, (676), 548 states have internal predecessors, (676), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:02:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 768 transitions. [2023-12-19 16:02:59,389 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 768 transitions. Word has length 176 [2023-12-19 16:02:59,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:59,389 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 768 transitions. [2023-12-19 16:02:59,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:02:59,390 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 768 transitions. [2023-12-19 16:02:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-19 16:02:59,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:59,390 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:59,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-19 16:02:59,391 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:59,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:59,391 INFO L85 PathProgramCache]: Analyzing trace with hash 466036363, now seen corresponding path program 1 times [2023-12-19 16:02:59,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:59,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851326517] [2023-12-19 16:02:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:59,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:02:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:02:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:02:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:02:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:02:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:02:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:02:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:02:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:02:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:02:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:02:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:02:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:02:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:02:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:02:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:02:59,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:59,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851326517] [2023-12-19 16:02:59,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851326517] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:59,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:59,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 16:02:59,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797394097] [2023-12-19 16:02:59,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:59,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 16:02:59,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:59,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 16:02:59,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:02:59,892 INFO L87 Difference]: Start difference. First operand 597 states and 768 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:03:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:00,161 INFO L93 Difference]: Finished difference Result 1181 states and 1508 transitions. [2023-12-19 16:03:00,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 16:03:00,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2023-12-19 16:03:00,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:00,164 INFO L225 Difference]: With dead ends: 1181 [2023-12-19 16:03:00,164 INFO L226 Difference]: Without dead ends: 647 [2023-12-19 16:03:00,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 16:03:00,165 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 191 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:00,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 450 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:03:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2023-12-19 16:03:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 582. [2023-12-19 16:03:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 533 states have (on average 1.2307692307692308) internal successors, (656), 533 states have internal predecessors, (656), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:03:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 748 transitions. [2023-12-19 16:03:00,200 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 748 transitions. Word has length 176 [2023-12-19 16:03:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:00,200 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 748 transitions. [2023-12-19 16:03:00,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:03:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 748 transitions. [2023-12-19 16:03:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-19 16:03:00,201 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:00,202 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:00,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-19 16:03:00,202 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:00,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:00,202 INFO L85 PathProgramCache]: Analyzing trace with hash 724201801, now seen corresponding path program 1 times [2023-12-19 16:03:00,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:00,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137426959] [2023-12-19 16:03:00,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:00,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:03:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:03:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:03:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:03:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:03:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:03:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:03:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:03:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:03:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:03:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:03:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:03:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:03:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:03:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:03:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:03:00,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:00,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137426959] [2023-12-19 16:03:00,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137426959] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:00,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:00,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 16:03:00,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415016484] [2023-12-19 16:03:00,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:00,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 16:03:00,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:00,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 16:03:00,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:03:00,687 INFO L87 Difference]: Start difference. First operand 582 states and 748 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:03:01,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:01,032 INFO L93 Difference]: Finished difference Result 1185 states and 1512 transitions. [2023-12-19 16:03:01,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 16:03:01,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2023-12-19 16:03:01,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:01,035 INFO L225 Difference]: With dead ends: 1185 [2023-12-19 16:03:01,035 INFO L226 Difference]: Without dead ends: 666 [2023-12-19 16:03:01,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-19 16:03:01,036 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 189 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:01,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 438 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:03:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2023-12-19 16:03:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 565. [2023-12-19 16:03:01,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 516 states have (on average 1.2306201550387597) internal successors, (635), 516 states have internal predecessors, (635), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:03:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 727 transitions. [2023-12-19 16:03:01,069 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 727 transitions. Word has length 176 [2023-12-19 16:03:01,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:01,069 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 727 transitions. [2023-12-19 16:03:01,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:03:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 727 transitions. [2023-12-19 16:03:01,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-19 16:03:01,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:01,070 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:01,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-19 16:03:01,070 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:01,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:01,071 INFO L85 PathProgramCache]: Analyzing trace with hash -679942459, now seen corresponding path program 1 times [2023-12-19 16:03:01,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:01,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947553425] [2023-12-19 16:03:01,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:01,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:03:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:03:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:03:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:03:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:03:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:03:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:03:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:03:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:03:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:03:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:03:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:03:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:03:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:03:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:03:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:03:02,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:02,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947553425] [2023-12-19 16:03:02,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947553425] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:02,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:02,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 16:03:02,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741146267] [2023-12-19 16:03:02,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:02,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 16:03:02,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:02,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 16:03:02,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-19 16:03:02,442 INFO L87 Difference]: Start difference. First operand 565 states and 727 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:03:03,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:03,486 INFO L93 Difference]: Finished difference Result 1143 states and 1463 transitions. [2023-12-19 16:03:03,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 16:03:03,487 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2023-12-19 16:03:03,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:03,489 INFO L225 Difference]: With dead ends: 1143 [2023-12-19 16:03:03,489 INFO L226 Difference]: Without dead ends: 641 [2023-12-19 16:03:03,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-12-19 16:03:03,491 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 257 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:03,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1101 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 16:03:03,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2023-12-19 16:03:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 546. [2023-12-19 16:03:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 497 states have (on average 1.2354124748490947) internal successors, (614), 497 states have internal predecessors, (614), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:03:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 706 transitions. [2023-12-19 16:03:03,531 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 706 transitions. Word has length 176 [2023-12-19 16:03:03,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:03,531 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 706 transitions. [2023-12-19 16:03:03,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:03:03,531 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 706 transitions. [2023-12-19 16:03:03,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-19 16:03:03,532 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:03,532 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:03,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-19 16:03:03,532 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:03,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:03,532 INFO L85 PathProgramCache]: Analyzing trace with hash 121802831, now seen corresponding path program 1 times [2023-12-19 16:03:03,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:03,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49595616] [2023-12-19 16:03:03,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:03,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 16:03:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 16:03:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 16:03:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 16:03:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 16:03:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 16:03:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 16:03:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 16:03:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 16:03:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 16:03:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 16:03:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 16:03:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 16:03:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 16:03:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 16:03:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:03,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-19 16:03:03,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:03,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49595616] [2023-12-19 16:03:03,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49595616] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:03,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:03,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 16:03:03,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600949558] [2023-12-19 16:03:03,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:03,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 16:03:03,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:03,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 16:03:03,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:03:03,657 INFO L87 Difference]: Start difference. First operand 546 states and 706 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:03:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:03,766 INFO L93 Difference]: Finished difference Result 1120 states and 1426 transitions. [2023-12-19 16:03:03,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:03:03,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2023-12-19 16:03:03,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:03,768 INFO L225 Difference]: With dead ends: 1120 [2023-12-19 16:03:03,769 INFO L226 Difference]: Without dead ends: 637 [2023-12-19 16:03:03,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:03:03,770 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 52 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:03,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 494 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 16:03:03,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2023-12-19 16:03:03,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 610. [2023-12-19 16:03:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 561 states have (on average 1.2192513368983957) internal successors, (684), 561 states have internal predecessors, (684), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 16:03:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 776 transitions. [2023-12-19 16:03:03,801 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 776 transitions. Word has length 177 [2023-12-19 16:03:03,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:03,802 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 776 transitions. [2023-12-19 16:03:03,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-19 16:03:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 776 transitions. [2023-12-19 16:03:03,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-19 16:03:03,804 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:03,804 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:03,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-19 16:03:03,804 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:03,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:03,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1745010886, now seen corresponding path program 1 times [2023-12-19 16:03:03,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:03,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866676838] [2023-12-19 16:03:03,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:03,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 16:03:03,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 16:03:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 16:03:03,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 16:03:03,983 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 16:03:03,984 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 16:03:03,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-19 16:03:03,987 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:03,989 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 16:03:04,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 04:03:04 BoogieIcfgContainer [2023-12-19 16:03:04,108 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 16:03:04,109 INFO L158 Benchmark]: Toolchain (without parser) took 27160.36ms. Allocated memory was 179.3MB in the beginning and 902.8MB in the end (delta: 723.5MB). Free memory was 122.0MB in the beginning and 840.5MB in the end (delta: -718.5MB). Peak memory consumption was 523.3MB. Max. memory is 8.0GB. [2023-12-19 16:03:04,109 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 16:03:04,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.20ms. Allocated memory is still 179.3MB. Free memory was 122.0MB in the beginning and 105.9MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-19 16:03:04,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.38ms. Allocated memory is still 179.3MB. Free memory was 105.9MB in the beginning and 102.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 16:03:04,109 INFO L158 Benchmark]: Boogie Preprocessor took 51.54ms. Allocated memory is still 179.3MB. Free memory was 102.3MB in the beginning and 97.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 16:03:04,109 INFO L158 Benchmark]: RCFGBuilder took 527.43ms. Allocated memory is still 179.3MB. Free memory was 97.8MB in the beginning and 115.8MB in the end (delta: -18.0MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2023-12-19 16:03:04,109 INFO L158 Benchmark]: TraceAbstraction took 26213.99ms. Allocated memory was 179.3MB in the beginning and 902.8MB in the end (delta: 723.5MB). Free memory was 114.8MB in the beginning and 840.5MB in the end (delta: -725.8MB). Peak memory consumption was 514.1MB. Max. memory is 8.0GB. [2023-12-19 16:03:04,110 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 179.3MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 294.20ms. Allocated memory is still 179.3MB. Free memory was 122.0MB in the beginning and 105.9MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.38ms. Allocated memory is still 179.3MB. Free memory was 105.9MB in the beginning and 102.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.54ms. Allocated memory is still 179.3MB. Free memory was 102.3MB in the beginning and 97.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 527.43ms. Allocated memory is still 179.3MB. Free memory was 97.8MB in the beginning and 115.8MB in the end (delta: -18.0MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * TraceAbstraction took 26213.99ms. Allocated memory was 179.3MB in the beginning and 902.8MB in the end (delta: 723.5MB). Free memory was 114.8MB in the beginning and 840.5MB in the end (delta: -725.8MB). Peak memory consumption was 514.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 143. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L59] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L60] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L61] unsigned char* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L62] double* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L63] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L64] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L65] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L66] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L67] signed char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L68] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L69] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L70] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L71] signed char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L72] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L73] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L74] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L75] unsigned char last_1_WrapperStruct00_var_1_5 = 0; [L147] isInitial = 1 [L148] FCALL initially() [L149] COND TRUE 1 [L150] CALL updateLastVariables() [L140] EXPR WrapperStruct00.var_1_5 [L140] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L150] RET updateLastVariables() [L151] CALL updateVariables() [L103] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L110] EXPR WrapperStruct00.var_1_4 [L110] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_4 [L110] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L111] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L113] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L114] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L116] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L117] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L119] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L120] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L121] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L122] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L123] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L124] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L125] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L126] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L127] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L128] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L129] WrapperStruct00.var_1_14 = __VERIFIER_nondet_char() [L130] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L131] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L132] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L133] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L133] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L133] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L134] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L134] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L134] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L135] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L136] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L136] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L136] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L137] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L137] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L137] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L151] RET updateVariables() [L152] CALL step() [L79] COND FALSE !(\read(last_1_WrapperStruct00_var_1_5)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L84] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L84] COND FALSE !((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) [L87] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L87] (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L87] (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L87] COND TRUE (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) [L88] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L88] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] (*(WrapperStruct00_var_1_5_Pointer)) = (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))) [L92] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L92] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] signed long int stepLocal_1 = ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1))); [L93] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L93] signed char stepLocal_0 = (*(WrapperStruct00_var_1_17_Pointer)); [L94] COND FALSE !(-10 >= stepLocal_0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L152] RET step() [L153] CALL, EXPR property() [L143] EXPR last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1 [L143] EXPR last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer)))))))) [L143] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L143] EXPR (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))) [L143] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L143] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) [L143] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1 [L143] EXPR (-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) [L143] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1 [L143] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L143] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143-L144] return (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) ; [L153] RET, EXPR property() [L153] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_5=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.1s, OverallIterations: 37, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5854 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5852 mSDsluCounter, 20590 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14815 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9485 IncrementalHoareTripleChecker+Invalid, 9729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 5775 mSDtfsCounter, 9485 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2054 GetRequests, 1768 SyntacticMatches, 6 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=610occurred in iteration=36, InterpolantAutomatonStates: 261, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 1728 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 6414 NumberOfCodeBlocks, 6414 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6199 ConstructedInterpolants, 0 QuantifiedInterpolants, 27686 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 36432/36432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-19 16:03:04,130 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...