/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 02:27:25,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 02:27:25,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 02:27:25,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 02:27:25,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 02:27:25,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 02:27:25,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 02:27:25,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 02:27:25,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 02:27:25,301 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 02:27:25,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 02:27:25,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 02:27:25,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 02:27:25,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 02:27:25,303 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 02:27:25,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 02:27:25,303 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 02:27:25,303 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 02:27:25,303 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 02:27:25,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 02:27:25,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 02:27:25,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 02:27:25,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 02:27:25,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 02:27:25,305 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 02:27:25,305 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 02:27:25,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 02:27:25,305 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 02:27:25,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 02:27:25,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 02:27:25,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 02:27:25,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 02:27:25,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:27:25,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 02:27:25,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 02:27:25,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 02:27:25,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 02:27:25,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 02:27:25,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 02:27:25,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 02:27:25,308 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 02:27:25,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 02:27:25,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 02:27:25,308 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 02:27:25,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 02:27:25,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 02:27:25,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 02:27:25,541 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 02:27:25,541 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 02:27:25,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i [2023-12-21 02:27:26,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 02:27:26,714 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 02:27:26,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i [2023-12-21 02:27:26,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc0b4000/455a08f1cf494cd095f6376395902237/FLAGaea05ec67 [2023-12-21 02:27:26,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc0b4000/455a08f1cf494cd095f6376395902237 [2023-12-21 02:27:26,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 02:27:26,745 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 02:27:26,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 02:27:26,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 02:27:26,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 02:27:26,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:27:26" (1/1) ... [2023-12-21 02:27:26,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b0e30dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:27:26, skipping insertion in model container [2023-12-21 02:27:26,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:27:26" (1/1) ... [2023-12-21 02:27:26,778 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 02:27:26,904 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-s_file-76.i[916,929] [2023-12-21 02:27:26,940 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:27:26,948 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 02:27:26,956 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-s_file-76.i[916,929] [2023-12-21 02:27:26,974 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:27:26,998 INFO L206 MainTranslator]: Completed translation [2023-12-21 02:27:26,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:27:26 WrapperNode [2023-12-21 02:27:26,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 02:27:26,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 02:27:27,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 02:27:27,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 02:27:27,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:27:26" (1/1) ... [2023-12-21 02:27:27,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:27:26" (1/1) ... [2023-12-21 02:27:27,050 INFO L138 Inliner]: procedures = 29, calls = 134, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 410 [2023-12-21 02:27:27,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 02:27:27,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 02:27:27,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 02:27:27,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 02:27:27,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:27:26" (1/1) ... [2023-12-21 02:27:27,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:27:26" (1/1) ... [2023-12-21 02:27:27,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:27:26" (1/1) ... [2023-12-21 02:27:27,085 INFO L175 MemorySlicer]: Split 107 memory accesses to 2 slices as follows [2, 105]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 17 writes are split as follows [0, 17]. [2023-12-21 02:27:27,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:27:26" (1/1) ... [2023-12-21 02:27:27,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:27:26" (1/1) ... [2023-12-21 02:27:27,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:27:26" (1/1) ... [2023-12-21 02:27:27,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:27:26" (1/1) ... [2023-12-21 02:27:27,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:27:26" (1/1) ... [2023-12-21 02:27:27,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:27:26" (1/1) ... [2023-12-21 02:27:27,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 02:27:27,113 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 02:27:27,113 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 02:27:27,113 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 02:27:27,114 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:27:26" (1/1) ... [2023-12-21 02:27:27,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:27:27,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:27:27,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 02:27:27,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 02:27:27,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 02:27:27,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 02:27:27,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 02:27:27,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 02:27:27,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 02:27:27,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 02:27:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 02:27:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 02:27:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 02:27:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 02:27:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 02:27:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 02:27:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 02:27:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 02:27:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 02:27:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 02:27:27,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 02:27:27,287 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 02:27:27,289 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 02:27:27,653 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 02:27:27,691 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 02:27:27,691 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 02:27:27,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:27:27 BoogieIcfgContainer [2023-12-21 02:27:27,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 02:27:27,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 02:27:27,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 02:27:27,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 02:27:27,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:27:26" (1/3) ... [2023-12-21 02:27:27,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bcdb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:27:27, skipping insertion in model container [2023-12-21 02:27:27,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:27:26" (2/3) ... [2023-12-21 02:27:27,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bcdb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:27:27, skipping insertion in model container [2023-12-21 02:27:27,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:27:27" (3/3) ... [2023-12-21 02:27:27,697 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-76.i [2023-12-21 02:27:27,708 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 02:27:27,708 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 02:27:27,754 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 02:27:27,759 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;@196123fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 02:27:27,759 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 02:27:27,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 02:27:27,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:27:27,779 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:27,780 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:27,783 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:27,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:27,788 INFO L85 PathProgramCache]: Analyzing trace with hash -268641406, now seen corresponding path program 1 times [2023-12-21 02:27:27,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:27,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63403330] [2023-12-21 02:27:27,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:27,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:28,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:28,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63403330] [2023-12-21 02:27:28,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63403330] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:28,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:28,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 02:27:28,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440986063] [2023-12-21 02:27:28,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:28,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 02:27:28,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:28,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 02:27:28,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:27:28,197 INFO L87 Difference]: Start difference. First operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 02:27:28,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:28,240 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2023-12-21 02:27:28,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 02:27:28,242 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2023-12-21 02:27:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:28,248 INFO L225 Difference]: With dead ends: 183 [2023-12-21 02:27:28,248 INFO L226 Difference]: Without dead ends: 89 [2023-12-21 02:27:28,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:27:28,254 INFO L413 NwaCegarLoop]: 124 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, 124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:28,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:27:28,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-21 02:27:28,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-21 02:27:28,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 02:27:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2023-12-21 02:27:28,303 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2023-12-21 02:27:28,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:28,303 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2023-12-21 02:27:28,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 02:27:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2023-12-21 02:27:28,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:27:28,306 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:28,306 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:28,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 02:27:28,306 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:28,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:28,307 INFO L85 PathProgramCache]: Analyzing trace with hash -691383482, now seen corresponding path program 1 times [2023-12-21 02:27:28,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:28,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599074380] [2023-12-21 02:27:28,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:28,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:28,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:28,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599074380] [2023-12-21 02:27:28,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599074380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:28,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:28,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:27:28,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574547114] [2023-12-21 02:27:28,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:28,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:27:28,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:28,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:27:28,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:27:28,627 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:28,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:28,648 INFO L93 Difference]: Finished difference Result 177 states and 255 transitions. [2023-12-21 02:27:28,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:27:28,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2023-12-21 02:27:28,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:28,649 INFO L225 Difference]: With dead ends: 177 [2023-12-21 02:27:28,649 INFO L226 Difference]: Without dead ends: 89 [2023-12-21 02:27:28,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:27:28,651 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:28,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:27:28,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-21 02:27:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-21 02:27:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 02:27:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2023-12-21 02:27:28,657 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 114 [2023-12-21 02:27:28,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:28,658 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2023-12-21 02:27:28,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:28,658 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2023-12-21 02:27:28,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-21 02:27:28,659 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:28,660 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:28,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 02:27:28,660 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:28,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:28,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1659991216, now seen corresponding path program 1 times [2023-12-21 02:27:28,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:28,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903432828] [2023-12-21 02:27:28,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:28,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,084 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:30,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:30,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903432828] [2023-12-21 02:27:30,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903432828] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:30,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:30,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 02:27:30,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961232557] [2023-12-21 02:27:30,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:30,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 02:27:30,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:30,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 02:27:30,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:27:30,090 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 02:27:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:30,734 INFO L93 Difference]: Finished difference Result 288 states and 406 transitions. [2023-12-21 02:27:30,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 02:27:30,735 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 115 [2023-12-21 02:27:30,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:30,738 INFO L225 Difference]: With dead ends: 288 [2023-12-21 02:27:30,738 INFO L226 Difference]: Without dead ends: 200 [2023-12-21 02:27:30,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-12-21 02:27:30,742 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 194 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:30,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 974 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 02:27:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-12-21 02:27:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 156. [2023-12-21 02:27:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 134 states have (on average 1.373134328358209) internal successors, (184), 135 states have internal predecessors, (184), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-21 02:27:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 222 transitions. [2023-12-21 02:27:30,769 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 222 transitions. Word has length 115 [2023-12-21 02:27:30,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:30,771 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 222 transitions. [2023-12-21 02:27:30,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 02:27:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 222 transitions. [2023-12-21 02:27:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-21 02:27:30,775 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:30,775 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:30,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 02:27:30,776 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:30,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1817327630, now seen corresponding path program 1 times [2023-12-21 02:27:30,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:30,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234336727] [2023-12-21 02:27:30,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:30,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:30,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:30,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234336727] [2023-12-21 02:27:30,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234336727] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:30,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:30,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:27:30,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785365166] [2023-12-21 02:27:30,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:30,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:27:30,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:30,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:27:30,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:27:30,873 INFO L87 Difference]: Start difference. First operand 156 states and 222 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:30,891 INFO L93 Difference]: Finished difference Result 258 states and 365 transitions. [2023-12-21 02:27:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:27:30,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2023-12-21 02:27:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:30,892 INFO L225 Difference]: With dead ends: 258 [2023-12-21 02:27:30,892 INFO L226 Difference]: Without dead ends: 103 [2023-12-21 02:27:30,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:27:30,893 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 24 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:30,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 218 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:27:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-21 02:27:30,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-12-21 02:27:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 02:27:30,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 143 transitions. [2023-12-21 02:27:30,899 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 143 transitions. Word has length 115 [2023-12-21 02:27:30,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:30,900 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 143 transitions. [2023-12-21 02:27:30,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 143 transitions. [2023-12-21 02:27:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 02:27:30,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:30,901 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:30,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 02:27:30,901 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:30,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:30,901 INFO L85 PathProgramCache]: Analyzing trace with hash 687426485, now seen corresponding path program 1 times [2023-12-21 02:27:30,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:30,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346854965] [2023-12-21 02:27:30,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:30,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,481 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:31,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:31,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346854965] [2023-12-21 02:27:31,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346854965] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:31,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:31,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:27:31,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31841056] [2023-12-21 02:27:31,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:31,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:27:31,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:31,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:27:31,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:27:31,482 INFO L87 Difference]: Start difference. First operand 103 states and 143 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 02:27:31,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:31,746 INFO L93 Difference]: Finished difference Result 278 states and 385 transitions. [2023-12-21 02:27:31,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:27:31,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2023-12-21 02:27:31,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:31,749 INFO L225 Difference]: With dead ends: 278 [2023-12-21 02:27:31,749 INFO L226 Difference]: Without dead ends: 176 [2023-12-21 02:27:31,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:27:31,750 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 171 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:31,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 375 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:27:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-12-21 02:27:31,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 103. [2023-12-21 02:27:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 85 states have internal predecessors, (112), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 02:27:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 142 transitions. [2023-12-21 02:27:31,763 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 142 transitions. Word has length 117 [2023-12-21 02:27:31,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:31,764 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 142 transitions. [2023-12-21 02:27:31,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 02:27:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 142 transitions. [2023-12-21 02:27:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 02:27:31,767 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:31,768 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:31,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 02:27:31,769 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:31,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2107864187, now seen corresponding path program 1 times [2023-12-21 02:27:31,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:31,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875070123] [2023-12-21 02:27:31,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:31,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,877 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:31,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:31,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875070123] [2023-12-21 02:27:31,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875070123] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:31,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:31,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:27:31,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706422568] [2023-12-21 02:27:31,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:31,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:27:31,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:31,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:27:31,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:27:31,878 INFO L87 Difference]: Start difference. First operand 103 states and 142 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:31,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:31,898 INFO L93 Difference]: Finished difference Result 223 states and 309 transitions. [2023-12-21 02:27:31,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:27:31,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2023-12-21 02:27:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:31,899 INFO L225 Difference]: With dead ends: 223 [2023-12-21 02:27:31,899 INFO L226 Difference]: Without dead ends: 121 [2023-12-21 02:27:31,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:27:31,901 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 33 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:31,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 256 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:27:31,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-21 02:27:31,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2023-12-21 02:27:31,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 02:27:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2023-12-21 02:27:31,911 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 117 [2023-12-21 02:27:31,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:31,911 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2023-12-21 02:27:31,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:31,911 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2023-12-21 02:27:31,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-21 02:27:31,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:31,913 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:31,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 02:27:31,913 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:31,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:31,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1449334213, now seen corresponding path program 1 times [2023-12-21 02:27:31,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:31,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870380672] [2023-12-21 02:27:31,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:31,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:31,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:31,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870380672] [2023-12-21 02:27:31,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870380672] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:31,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:31,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:27:31,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865065451] [2023-12-21 02:27:31,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:31,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:27:31,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:31,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:27:31,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:27:31,989 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:32,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:32,008 INFO L93 Difference]: Finished difference Result 207 states and 285 transitions. [2023-12-21 02:27:32,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:27:32,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-21 02:27:32,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:32,009 INFO L225 Difference]: With dead ends: 207 [2023-12-21 02:27:32,009 INFO L226 Difference]: Without dead ends: 105 [2023-12-21 02:27:32,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:27:32,011 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:32,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:27:32,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-21 02:27:32,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-12-21 02:27:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 87 states have internal predecessors, (113), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 02:27:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 143 transitions. [2023-12-21 02:27:32,019 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 143 transitions. Word has length 119 [2023-12-21 02:27:32,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:32,020 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 143 transitions. [2023-12-21 02:27:32,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:32,020 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 143 transitions. [2023-12-21 02:27:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-21 02:27:32,021 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:32,021 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:32,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 02:27:32,021 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:32,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:32,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2036140227, now seen corresponding path program 1 times [2023-12-21 02:27:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:32,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208862862] [2023-12-21 02:27:32,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:32,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:32,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:32,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:32,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:32,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:32,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:32,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:32,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:32,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:32,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:32,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:32,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:32,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:32,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:32,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:32,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:32,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:32,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208862862] [2023-12-21 02:27:32,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208862862] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:32,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:32,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 02:27:32,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966411938] [2023-12-21 02:27:32,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:32,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:27:32,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:32,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:27:32,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:27:32,600 INFO L87 Difference]: Start difference. First operand 105 states and 143 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 02:27:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:32,940 INFO L93 Difference]: Finished difference Result 263 states and 355 transitions. [2023-12-21 02:27:32,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 02:27:32,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2023-12-21 02:27:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:32,942 INFO L225 Difference]: With dead ends: 263 [2023-12-21 02:27:32,942 INFO L226 Difference]: Without dead ends: 159 [2023-12-21 02:27:32,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:27:32,943 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 129 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:32,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 524 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:27:32,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-12-21 02:27:32,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 104. [2023-12-21 02:27:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 02:27:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 141 transitions. [2023-12-21 02:27:32,952 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 141 transitions. Word has length 119 [2023-12-21 02:27:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:32,952 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 141 transitions. [2023-12-21 02:27:32,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 02:27:32,952 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 141 transitions. [2023-12-21 02:27:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-21 02:27:32,954 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:32,954 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:32,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 02:27:32,954 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:32,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:32,954 INFO L85 PathProgramCache]: Analyzing trace with hash 896121367, now seen corresponding path program 1 times [2023-12-21 02:27:32,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:32,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668819680] [2023-12-21 02:27:32,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:32,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:33,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:33,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668819680] [2023-12-21 02:27:33,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668819680] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:33,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:33,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:27:33,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678711512] [2023-12-21 02:27:33,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:33,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:27:33,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:33,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:27:33,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:27:33,088 INFO L87 Difference]: Start difference. First operand 104 states and 141 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:33,139 INFO L93 Difference]: Finished difference Result 227 states and 309 transitions. [2023-12-21 02:27:33,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:27:33,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-21 02:27:33,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:33,141 INFO L225 Difference]: With dead ends: 227 [2023-12-21 02:27:33,141 INFO L226 Difference]: Without dead ends: 124 [2023-12-21 02:27:33,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:27:33,143 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 98 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:33,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 593 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:27:33,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-12-21 02:27:33,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 108. [2023-12-21 02:27:33,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 02:27:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 145 transitions. [2023-12-21 02:27:33,150 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 145 transitions. Word has length 119 [2023-12-21 02:27:33,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:33,151 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 145 transitions. [2023-12-21 02:27:33,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:33,151 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 145 transitions. [2023-12-21 02:27:33,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-21 02:27:33,152 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:33,152 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:33,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 02:27:33,152 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:33,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:33,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2037408384, now seen corresponding path program 1 times [2023-12-21 02:27:33,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:33,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917707900] [2023-12-21 02:27:33,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:33,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:33,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:33,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917707900] [2023-12-21 02:27:33,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917707900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:33,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:33,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 02:27:33,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979991429] [2023-12-21 02:27:33,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:33,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:27:33,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:33,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:27:33,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:27:33,880 INFO L87 Difference]: Start difference. First operand 108 states and 145 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 02:27:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:34,092 INFO L93 Difference]: Finished difference Result 228 states and 305 transitions. [2023-12-21 02:27:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 02:27:34,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2023-12-21 02:27:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:34,094 INFO L225 Difference]: With dead ends: 228 [2023-12-21 02:27:34,095 INFO L226 Difference]: Without dead ends: 121 [2023-12-21 02:27:34,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-12-21 02:27:34,096 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 113 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:34,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 536 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:27:34,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-21 02:27:34,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2023-12-21 02:27:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 83 states have internal predecessors, (106), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 02:27:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 136 transitions. [2023-12-21 02:27:34,107 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 136 transitions. Word has length 121 [2023-12-21 02:27:34,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:34,107 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 136 transitions. [2023-12-21 02:27:34,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 02:27:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 136 transitions. [2023-12-21 02:27:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-21 02:27:34,108 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:34,108 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:34,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 02:27:34,109 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:34,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:34,109 INFO L85 PathProgramCache]: Analyzing trace with hash -751210596, now seen corresponding path program 1 times [2023-12-21 02:27:34,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:34,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885126263] [2023-12-21 02:27:34,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:34,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:34,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:34,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:34,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:34,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:34,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:34,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:34,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:34,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:34,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:34,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:34,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:34,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:34,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:34,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:34,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:34,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:34,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885126263] [2023-12-21 02:27:34,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885126263] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:34,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:34,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:27:34,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380802977] [2023-12-21 02:27:34,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:34,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:27:34,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:34,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:27:34,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:27:34,723 INFO L87 Difference]: Start difference. First operand 101 states and 136 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 02:27:35,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:35,031 INFO L93 Difference]: Finished difference Result 295 states and 397 transitions. [2023-12-21 02:27:35,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 02:27:35,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2023-12-21 02:27:35,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:35,032 INFO L225 Difference]: With dead ends: 295 [2023-12-21 02:27:35,032 INFO L226 Difference]: Without dead ends: 195 [2023-12-21 02:27:35,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:27:35,033 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 198 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:35,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 411 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:27:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-21 02:27:35,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 110. [2023-12-21 02:27:35,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 92 states have internal predecessors, (116), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 02:27:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 146 transitions. [2023-12-21 02:27:35,041 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 146 transitions. Word has length 121 [2023-12-21 02:27:35,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:35,042 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 146 transitions. [2023-12-21 02:27:35,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 02:27:35,042 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 146 transitions. [2023-12-21 02:27:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-21 02:27:35,043 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:35,043 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:35,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 02:27:35,043 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:35,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:35,043 INFO L85 PathProgramCache]: Analyzing trace with hash -60439536, now seen corresponding path program 1 times [2023-12-21 02:27:35,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:35,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089747488] [2023-12-21 02:27:35,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:35,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:35,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:35,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:35,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:35,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:35,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:35,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:35,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:35,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:35,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:35,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:35,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:35,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:35,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:35,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:35,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:35,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:35,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089747488] [2023-12-21 02:27:35,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089747488] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:35,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:35,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 02:27:35,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946107779] [2023-12-21 02:27:35,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:35,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:27:35,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:35,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:27:35,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:27:35,636 INFO L87 Difference]: Start difference. First operand 110 states and 146 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:36,047 INFO L93 Difference]: Finished difference Result 327 states and 434 transitions. [2023-12-21 02:27:36,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 02:27:36,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2023-12-21 02:27:36,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:36,049 INFO L225 Difference]: With dead ends: 327 [2023-12-21 02:27:36,049 INFO L226 Difference]: Without dead ends: 218 [2023-12-21 02:27:36,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-21 02:27:36,050 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 171 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:36,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 703 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:27:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-12-21 02:27:36,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 207. [2023-12-21 02:27:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 176 states have (on average 1.2613636363636365) internal successors, (222), 177 states have internal predecessors, (222), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-21 02:27:36,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 274 transitions. [2023-12-21 02:27:36,067 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 274 transitions. Word has length 123 [2023-12-21 02:27:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:36,068 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 274 transitions. [2023-12-21 02:27:36,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 274 transitions. [2023-12-21 02:27:36,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-21 02:27:36,069 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:36,069 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:36,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 02:27:36,069 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:36,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:36,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1482806458, now seen corresponding path program 1 times [2023-12-21 02:27:36,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:36,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429269142] [2023-12-21 02:27:36,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:36,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:36,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:36,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429269142] [2023-12-21 02:27:36,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429269142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:36,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:36,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:27:36,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367528098] [2023-12-21 02:27:36,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:36,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:27:36,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:36,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:27:36,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:27:36,234 INFO L87 Difference]: Start difference. First operand 207 states and 274 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:36,398 INFO L93 Difference]: Finished difference Result 439 states and 581 transitions. [2023-12-21 02:27:36,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:27:36,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-12-21 02:27:36,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:36,400 INFO L225 Difference]: With dead ends: 439 [2023-12-21 02:27:36,400 INFO L226 Difference]: Without dead ends: 233 [2023-12-21 02:27:36,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:27:36,401 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 83 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:36,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 460 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:27:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-12-21 02:27:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 211. [2023-12-21 02:27:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 179 states have (on average 1.2513966480446927) internal successors, (224), 180 states have internal predecessors, (224), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-21 02:27:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 276 transitions. [2023-12-21 02:27:36,418 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 276 transitions. Word has length 124 [2023-12-21 02:27:36,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:36,418 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 276 transitions. [2023-12-21 02:27:36,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 276 transitions. [2023-12-21 02:27:36,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-21 02:27:36,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:36,419 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:36,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 02:27:36,419 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:36,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:36,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1162199371, now seen corresponding path program 1 times [2023-12-21 02:27:36,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:36,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488980625] [2023-12-21 02:27:36,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:36,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:36,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:36,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488980625] [2023-12-21 02:27:36,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488980625] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:36,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:36,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 02:27:36,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434047430] [2023-12-21 02:27:36,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:36,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:27:36,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:36,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:27:36,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:27:36,932 INFO L87 Difference]: Start difference. First operand 211 states and 276 transitions. Second operand has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2023-12-21 02:27:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:37,272 INFO L93 Difference]: Finished difference Result 360 states and 465 transitions. [2023-12-21 02:27:37,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 02:27:37,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2023-12-21 02:27:37,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:37,274 INFO L225 Difference]: With dead ends: 360 [2023-12-21 02:27:37,274 INFO L226 Difference]: Without dead ends: 358 [2023-12-21 02:27:37,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-21 02:27:37,275 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 89 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:37,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 466 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:27:37,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-12-21 02:27:37,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 355. [2023-12-21 02:27:37,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 294 states have (on average 1.2244897959183674) internal successors, (360), 297 states have internal predecessors, (360), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-21 02:27:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 460 transitions. [2023-12-21 02:27:37,309 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 460 transitions. Word has length 125 [2023-12-21 02:27:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:37,309 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 460 transitions. [2023-12-21 02:27:37,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2023-12-21 02:27:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 460 transitions. [2023-12-21 02:27:37,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-21 02:27:37,310 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:37,310 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:37,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 02:27:37,311 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:37,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:37,311 INFO L85 PathProgramCache]: Analyzing trace with hash -908567350, now seen corresponding path program 1 times [2023-12-21 02:27:37,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:37,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166630424] [2023-12-21 02:27:37,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:37,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:37,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:37,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166630424] [2023-12-21 02:27:37,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166630424] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:37,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:37,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:27:37,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731784547] [2023-12-21 02:27:37,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:37,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:27:37,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:37,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:27:37,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:27:37,473 INFO L87 Difference]: Start difference. First operand 355 states and 460 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:37,640 INFO L93 Difference]: Finished difference Result 717 states and 925 transitions. [2023-12-21 02:27:37,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:27:37,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-12-21 02:27:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:37,642 INFO L225 Difference]: With dead ends: 717 [2023-12-21 02:27:37,642 INFO L226 Difference]: Without dead ends: 363 [2023-12-21 02:27:37,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:27:37,644 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 75 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:37,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 350 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:27:37,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-12-21 02:27:37,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 353. [2023-12-21 02:27:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 290 states have (on average 1.210344827586207) internal successors, (351), 293 states have internal predecessors, (351), 50 states have call successors, (50), 12 states have call predecessors, (50), 12 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-21 02:27:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 451 transitions. [2023-12-21 02:27:37,678 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 451 transitions. Word has length 125 [2023-12-21 02:27:37,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:37,678 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 451 transitions. [2023-12-21 02:27:37,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 451 transitions. [2023-12-21 02:27:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-21 02:27:37,679 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:37,679 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:37,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 02:27:37,679 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:37,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:37,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2003579264, now seen corresponding path program 1 times [2023-12-21 02:27:37,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:37,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047534469] [2023-12-21 02:27:37,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:37,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:37,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:37,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047534469] [2023-12-21 02:27:37,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047534469] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:37,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:37,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 02:27:37,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270031055] [2023-12-21 02:27:37,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:37,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:27:37,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:37,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:27:37,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:27:37,970 INFO L87 Difference]: Start difference. First operand 353 states and 451 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:38,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:38,307 INFO L93 Difference]: Finished difference Result 898 states and 1147 transitions. [2023-12-21 02:27:38,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 02:27:38,307 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-12-21 02:27:38,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:38,312 INFO L225 Difference]: With dead ends: 898 [2023-12-21 02:27:38,312 INFO L226 Difference]: Without dead ends: 546 [2023-12-21 02:27:38,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2023-12-21 02:27:38,313 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 216 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:38,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1157 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:27:38,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2023-12-21 02:27:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 516. [2023-12-21 02:27:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 433 states have (on average 1.210161662817552) internal successors, (524), 438 states have internal predecessors, (524), 64 states have call successors, (64), 18 states have call predecessors, (64), 18 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-21 02:27:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 652 transitions. [2023-12-21 02:27:38,367 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 652 transitions. Word has length 126 [2023-12-21 02:27:38,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:38,368 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 652 transitions. [2023-12-21 02:27:38,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 652 transitions. [2023-12-21 02:27:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-21 02:27:38,369 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:38,369 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:38,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 02:27:38,369 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:38,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:38,370 INFO L85 PathProgramCache]: Analyzing trace with hash -80351230, now seen corresponding path program 1 times [2023-12-21 02:27:38,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:38,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321500135] [2023-12-21 02:27:38,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:38,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:38,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:38,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:38,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:38,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:38,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:38,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:38,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:38,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:38,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:38,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:38,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:38,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:38,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:38,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:38,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:38,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:38,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321500135] [2023-12-21 02:27:38,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321500135] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:38,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:38,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:27:38,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850529517] [2023-12-21 02:27:38,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:38,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:27:38,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:38,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:27:38,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:27:38,511 INFO L87 Difference]: Start difference. First operand 516 states and 652 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:38,796 INFO L93 Difference]: Finished difference Result 1263 states and 1604 transitions. [2023-12-21 02:27:38,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:27:38,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-12-21 02:27:38,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:38,800 INFO L225 Difference]: With dead ends: 1263 [2023-12-21 02:27:38,800 INFO L226 Difference]: Without dead ends: 748 [2023-12-21 02:27:38,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:27:38,802 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 180 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:38,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 369 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:27:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2023-12-21 02:27:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 517. [2023-12-21 02:27:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 434 states have (on average 1.2027649769585254) internal successors, (522), 439 states have internal predecessors, (522), 64 states have call successors, (64), 18 states have call predecessors, (64), 18 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-21 02:27:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 650 transitions. [2023-12-21 02:27:38,868 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 650 transitions. Word has length 126 [2023-12-21 02:27:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:38,869 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 650 transitions. [2023-12-21 02:27:38,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 650 transitions. [2023-12-21 02:27:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-21 02:27:38,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:38,870 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:38,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 02:27:38,871 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:38,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1289567892, now seen corresponding path program 1 times [2023-12-21 02:27:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:38,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115427617] [2023-12-21 02:27:38,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:38,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:39,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:39,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:39,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:39,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:39,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:39,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:39,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:39,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:39,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:39,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:39,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:39,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:39,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:39,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:39,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-21 02:27:39,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:39,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115427617] [2023-12-21 02:27:39,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115427617] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:27:39,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355983987] [2023-12-21 02:27:39,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:39,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:27:39,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:27:39,467 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:27:39,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 02:27:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:39,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-21 02:27:39,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:27:39,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:27:39,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-12-21 02:27:39,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-12-21 02:27:39,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-12-21 02:27:39,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-12-21 02:27:39,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-12-21 02:27:39,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-12-21 02:27:39,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2023-12-21 02:27:39,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:27:39,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 27 [2023-12-21 02:27:39,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:27:39,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 14 [2023-12-21 02:27:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 204 proven. 27 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-12-21 02:27:39,978 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:27:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-21 02:27:40,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355983987] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 02:27:40,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 02:27:40,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2023-12-21 02:27:40,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173054253] [2023-12-21 02:27:40,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 02:27:40,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 02:27:40,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:40,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 02:27:40,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-12-21 02:27:40,181 INFO L87 Difference]: Start difference. First operand 517 states and 650 transitions. Second operand has 12 states, 10 states have (on average 7.1) internal successors, (71), 12 states have internal predecessors, (71), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2023-12-21 02:27:40,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:40,807 INFO L93 Difference]: Finished difference Result 1053 states and 1303 transitions. [2023-12-21 02:27:40,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-21 02:27:40,807 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.1) internal successors, (71), 12 states have internal predecessors, (71), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 127 [2023-12-21 02:27:40,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:40,809 INFO L225 Difference]: With dead ends: 1053 [2023-12-21 02:27:40,809 INFO L226 Difference]: Without dead ends: 537 [2023-12-21 02:27:40,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 276 SyntacticMatches, 11 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2023-12-21 02:27:40,810 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 354 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:40,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 251 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 02:27:40,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2023-12-21 02:27:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 521. [2023-12-21 02:27:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 412 states have (on average 1.1577669902912622) internal successors, (477), 418 states have internal predecessors, (477), 79 states have call successors, (79), 29 states have call predecessors, (79), 29 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2023-12-21 02:27:40,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 635 transitions. [2023-12-21 02:27:40,855 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 635 transitions. Word has length 127 [2023-12-21 02:27:40,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:40,856 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 635 transitions. [2023-12-21 02:27:40,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.1) internal successors, (71), 12 states have internal predecessors, (71), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2023-12-21 02:27:40,857 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 635 transitions. [2023-12-21 02:27:40,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-21 02:27:40,857 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:40,857 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:40,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 02:27:41,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-21 02:27:41,065 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:41,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:41,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1108951021, now seen corresponding path program 1 times [2023-12-21 02:27:41,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:41,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132952585] [2023-12-21 02:27:41,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:41,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:41,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:41,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132952585] [2023-12-21 02:27:41,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132952585] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:41,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:41,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:27:41,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117213729] [2023-12-21 02:27:41,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:41,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:27:41,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:41,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:27:41,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:27:41,181 INFO L87 Difference]: Start difference. First operand 521 states and 635 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:41,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:41,385 INFO L93 Difference]: Finished difference Result 770 states and 932 transitions. [2023-12-21 02:27:41,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:27:41,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2023-12-21 02:27:41,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:41,387 INFO L225 Difference]: With dead ends: 770 [2023-12-21 02:27:41,387 INFO L226 Difference]: Without dead ends: 305 [2023-12-21 02:27:41,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:27:41,388 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 85 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:41,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 348 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:27:41,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-12-21 02:27:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 248. [2023-12-21 02:27:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 201 states have (on average 1.1293532338308458) internal successors, (227), 203 states have internal predecessors, (227), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-21 02:27:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 293 transitions. [2023-12-21 02:27:41,411 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 293 transitions. Word has length 127 [2023-12-21 02:27:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:41,412 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 293 transitions. [2023-12-21 02:27:41,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:41,412 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 293 transitions. [2023-12-21 02:27:41,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-21 02:27:41,413 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:41,413 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:41,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-21 02:27:41,413 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:41,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:41,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1610406102, now seen corresponding path program 1 times [2023-12-21 02:27:41,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:41,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939438685] [2023-12-21 02:27:41,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:41,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,470 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:41,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:41,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939438685] [2023-12-21 02:27:41,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939438685] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:41,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:41,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:27:41,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018318102] [2023-12-21 02:27:41,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:41,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:27:41,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:41,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:27:41,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:27:41,472 INFO L87 Difference]: Start difference. First operand 248 states and 293 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:41,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:41,506 INFO L93 Difference]: Finished difference Result 507 states and 600 transitions. [2023-12-21 02:27:41,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:27:41,507 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-12-21 02:27:41,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:41,508 INFO L225 Difference]: With dead ends: 507 [2023-12-21 02:27:41,508 INFO L226 Difference]: Without dead ends: 260 [2023-12-21 02:27:41,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:27:41,510 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:41,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 194 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:27:41,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-12-21 02:27:41,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 251. [2023-12-21 02:27:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 204 states have (on average 1.1274509803921569) internal successors, (230), 206 states have internal predecessors, (230), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-21 02:27:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 296 transitions. [2023-12-21 02:27:41,534 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 296 transitions. Word has length 128 [2023-12-21 02:27:41,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:41,534 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 296 transitions. [2023-12-21 02:27:41,534 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:41,534 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 296 transitions. [2023-12-21 02:27:41,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-21 02:27:41,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:27:41,536 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:27:41,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-21 02:27:41,536 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:27:41,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:27:41,536 INFO L85 PathProgramCache]: Analyzing trace with hash 164601260, now seen corresponding path program 1 times [2023-12-21 02:27:41,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:27:41,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927827266] [2023-12-21 02:27:41,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:27:41,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:27:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:27:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:27:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:27:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:27:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:27:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:27:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:27:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:27:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:27:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:27:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:27:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:27:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:27:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:27:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:27:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:27:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:27:41,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:27:41,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927827266] [2023-12-21 02:27:41,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927827266] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:27:41,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:27:41,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:27:41,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142064381] [2023-12-21 02:27:41,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:27:41,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:27:41,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:27:41,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:27:41,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:27:41,685 INFO L87 Difference]: Start difference. First operand 251 states and 296 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:41,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:27:41,801 INFO L93 Difference]: Finished difference Result 529 states and 621 transitions. [2023-12-21 02:27:41,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:27:41,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-12-21 02:27:41,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:27:41,801 INFO L225 Difference]: With dead ends: 529 [2023-12-21 02:27:41,801 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 02:27:41,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:27:41,803 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 60 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:27:41,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 323 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:27:41,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 02:27:41,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 02:27:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 02:27:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 02:27:41,804 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2023-12-21 02:27:41,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:27:41,804 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 02:27:41,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 02:27:41,804 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 02:27:41,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 02:27:41,806 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:27:41,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-21 02:27:41,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 02:27:42,792 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-21 02:27:42,792 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-21 02:27:42,792 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-21 02:27:42,792 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-21 02:27:42,792 INFO L899 garLoopResultBuilder]: For program point L117-21(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,792 INFO L899 garLoopResultBuilder]: For program point L117-23(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,792 INFO L899 garLoopResultBuilder]: For program point L117-25(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,792 INFO L899 garLoopResultBuilder]: For program point L117-26(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,792 INFO L899 garLoopResultBuilder]: For program point L117-27(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,792 INFO L899 garLoopResultBuilder]: For program point L117-29(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,792 INFO L899 garLoopResultBuilder]: For program point L117-30(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,792 INFO L899 garLoopResultBuilder]: For program point L117-31(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,792 INFO L899 garLoopResultBuilder]: For program point L117-32(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,792 INFO L899 garLoopResultBuilder]: For program point L117-34(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,792 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-21 02:27:42,792 INFO L899 garLoopResultBuilder]: For program point L117-35(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,792 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-21 02:27:42,793 INFO L899 garLoopResultBuilder]: For program point L117-37(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,793 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-21 02:27:42,793 INFO L899 garLoopResultBuilder]: For program point L117-39(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,793 INFO L899 garLoopResultBuilder]: For program point L117-41(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,793 INFO L899 garLoopResultBuilder]: For program point L117-43(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,793 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-12-21 02:27:42,793 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-12-21 02:27:42,793 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 87) no Hoare annotation was computed. [2023-12-21 02:27:42,793 INFO L895 garLoopResultBuilder]: At program point L104(line 104) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-12-21 02:27:42,793 INFO L899 garLoopResultBuilder]: For program point L104-1(line 104) no Hoare annotation was computed. [2023-12-21 02:27:42,793 INFO L895 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-12-21 02:27:42,793 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2023-12-21 02:27:42,794 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 60) no Hoare annotation was computed. [2023-12-21 02:27:42,794 INFO L899 garLoopResultBuilder]: For program point L56-2(lines 56 60) no Hoare annotation was computed. [2023-12-21 02:27:42,794 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2023-12-21 02:27:42,794 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2023-12-21 02:27:42,794 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (let ((.cse2 (let ((.cse9 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse9 (let ((.cse10 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse9 (* (- 1) .cse10)) 256) 256) .cse10))))) (.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (or (and (<= .cse0 (* (div .cse0 256) 256)) (not (= (select .cse1 (+ |~#WrapperStruct00~0.offset| 2)) (select .cse1 (+ |~#WrapperStruct00~0.offset| 25)))) .cse2) (let ((.cse6 (select .cse1 (+ |~#WrapperStruct00~0.offset| 26)))) (let ((.cse8 (+ .cse6 240))) (let ((.cse4 (+ 112 .cse6)) (.cse7 (select .cse1 (+ 23 |~#WrapperStruct00~0.offset|))) (.cse5 (* 256 (div .cse8 256))) (.cse3 (select .cse1 |~#WrapperStruct00~0.offset|))) (and (<= .cse3 (* (div .cse3 256) 256)) (or (< .cse4 .cse5) (= .cse6 (+ .cse7 16 .cse5))) (or (< .cse6 (+ (* (div .cse4 256) 256) 16)) (= (+ .cse7 .cse5) .cse8)) .cse2 (= .cse0 .cse3)))))))) [2023-12-21 02:27:42,794 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-12-21 02:27:42,794 INFO L895 garLoopResultBuilder]: At program point L123-2(lines 123 129) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (let ((.cse2 (let ((.cse9 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse9 (let ((.cse10 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse9 (* (- 1) .cse10)) 256) 256) .cse10))))) (.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (or (and (<= .cse0 (* (div .cse0 256) 256)) (not (= (select .cse1 (+ |~#WrapperStruct00~0.offset| 2)) (select .cse1 (+ |~#WrapperStruct00~0.offset| 25)))) .cse2) (let ((.cse6 (select .cse1 (+ |~#WrapperStruct00~0.offset| 26)))) (let ((.cse8 (+ .cse6 240))) (let ((.cse4 (+ 112 .cse6)) (.cse7 (select .cse1 (+ 23 |~#WrapperStruct00~0.offset|))) (.cse5 (* 256 (div .cse8 256))) (.cse3 (select .cse1 |~#WrapperStruct00~0.offset|))) (and (<= .cse3 (* (div .cse3 256) 256)) (or (< .cse4 .cse5) (= .cse6 (+ .cse7 16 .cse5))) (or (< .cse6 (+ (* (div .cse4 256) 256) 16)) (= (+ .cse7 .cse5) .cse8)) .cse2 (= .cse0 .cse3)))))))) [2023-12-21 02:27:42,794 INFO L899 garLoopResultBuilder]: For program point L123-3(lines 123 129) no Hoare annotation was computed. [2023-12-21 02:27:42,794 INFO L895 garLoopResultBuilder]: At program point L107(line 107) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-12-21 02:27:42,794 INFO L899 garLoopResultBuilder]: For program point L107-1(line 107) no Hoare annotation was computed. [2023-12-21 02:27:42,794 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 76) no Hoare annotation was computed. [2023-12-21 02:27:42,794 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 02:27:42,795 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (let ((.cse2 (let ((.cse9 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse9 (let ((.cse10 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse9 (* (- 1) .cse10)) 256) 256) .cse10))))) (.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (or (and (<= .cse0 (* (div .cse0 256) 256)) (not (= (select .cse1 (+ |~#WrapperStruct00~0.offset| 2)) (select .cse1 (+ |~#WrapperStruct00~0.offset| 25)))) .cse2) (let ((.cse6 (select .cse1 (+ |~#WrapperStruct00~0.offset| 26)))) (let ((.cse8 (+ .cse6 240))) (let ((.cse4 (+ 112 .cse6)) (.cse7 (select .cse1 (+ 23 |~#WrapperStruct00~0.offset|))) (.cse5 (* 256 (div .cse8 256))) (.cse3 (select .cse1 |~#WrapperStruct00~0.offset|))) (and (<= .cse3 (* (div .cse3 256) 256)) (or (< .cse4 .cse5) (= .cse6 (+ .cse7 16 .cse5))) (or (< .cse6 (+ (* (div .cse4 256) 256) 16)) (= (+ .cse7 .cse5) .cse8)) .cse2 (= .cse0 .cse3)))))))) [2023-12-21 02:27:42,795 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-12-21 02:27:42,795 INFO L895 garLoopResultBuilder]: At program point L108(line 108) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-12-21 02:27:42,795 INFO L899 garLoopResultBuilder]: For program point L108-1(line 108) no Hoare annotation was computed. [2023-12-21 02:27:42,795 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-21 02:27:42,795 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2023-12-21 02:27:42,795 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-12-21 02:27:42,795 INFO L899 garLoopResultBuilder]: For program point L93-1(line 93) no Hoare annotation was computed. [2023-12-21 02:27:42,795 INFO L895 garLoopResultBuilder]: At program point L110(line 110) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (= |ULTIMATE.start_updateVariables_#t~mem59#1| (select .cse1 (+ |~#WrapperStruct00~0.offset| 28))))) [2023-12-21 02:27:42,795 INFO L899 garLoopResultBuilder]: For program point L110-1(line 110) no Hoare annotation was computed. [2023-12-21 02:27:42,796 INFO L895 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-12-21 02:27:42,796 INFO L899 garLoopResultBuilder]: For program point L94-1(line 94) no Hoare annotation was computed. [2023-12-21 02:27:42,796 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 71) no Hoare annotation was computed. [2023-12-21 02:27:42,796 INFO L895 garLoopResultBuilder]: At program point L111(line 111) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (= |ULTIMATE.start_updateVariables_#t~mem60#1| (select .cse1 (+ |~#WrapperStruct00~0.offset| 28))))) [2023-12-21 02:27:42,796 INFO L899 garLoopResultBuilder]: For program point L111-1(line 111) no Hoare annotation was computed. [2023-12-21 02:27:42,796 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 86) no Hoare annotation was computed. [2023-12-21 02:27:42,796 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-12-21 02:27:42,796 INFO L899 garLoopResultBuilder]: For program point L62-2(line 62) no Hoare annotation was computed. [2023-12-21 02:27:42,796 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-12-21 02:27:42,796 INFO L899 garLoopResultBuilder]: For program point L79-2(lines 79 83) no Hoare annotation was computed. [2023-12-21 02:27:42,796 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 02:27:42,796 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (let ((.cse2 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (let ((.cse0 (select .cse2 (+ |~#WrapperStruct00~0.offset| 28)))) (< .cse0 (let ((.cse1 (select .cse2 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse0 (* (- 1) .cse1)) 256) 256) .cse1 1))))) [2023-12-21 02:27:42,796 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-12-21 02:27:42,796 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-21 02:27:42,796 INFO L899 garLoopResultBuilder]: For program point L80-2(line 80) no Hoare annotation was computed. [2023-12-21 02:27:42,796 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (let ((.cse0 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (= |ULTIMATE.start_updateVariables_#t~mem40#1| (select .cse0 (+ |~#WrapperStruct00~0.offset| 6))) (let ((.cse1 (select .cse0 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse1 (let ((.cse2 (select .cse0 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse1 (* (- 1) .cse2)) 256) 256) .cse2)))))) [2023-12-21 02:27:42,796 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 70) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point L99-2(line 99) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point L99-3(line 99) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point L99-5(line 99) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point L99-7(line 99) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L895 garLoopResultBuilder]: At program point L99-8(line 99) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point L99-9(line 99) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 69) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point L67-2(lines 61 71) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point L117-2(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point L117-3(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point L117-4(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point L117-5(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point L117-6(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point L117-8(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,797 INFO L899 garLoopResultBuilder]: For program point L117-10(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,798 INFO L899 garLoopResultBuilder]: For program point L117-12(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,798 INFO L899 garLoopResultBuilder]: For program point L117-14(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,798 INFO L899 garLoopResultBuilder]: For program point L117-15(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,798 INFO L895 garLoopResultBuilder]: At program point L101(line 101) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-12-21 02:27:42,798 INFO L899 garLoopResultBuilder]: For program point L117-16(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,798 INFO L899 garLoopResultBuilder]: For program point L101-1(line 101) no Hoare annotation was computed. [2023-12-21 02:27:42,798 INFO L899 garLoopResultBuilder]: For program point L117-17(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,798 INFO L899 garLoopResultBuilder]: For program point L117-19(line 117) no Hoare annotation was computed. [2023-12-21 02:27:42,800 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] [2023-12-21 02:27:42,801 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:27:42,809 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 6] could not be translated [2023-12-21 02:27:42,809 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 6] could not be translated [2023-12-21 02:27:42,811 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 2] could not be translated [2023-12-21 02:27:42,811 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 25] could not be translated [2023-12-21 02:27:42,811 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 28] could not be translated [2023-12-21 02:27:42,811 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 28] could not be translated [2023-12-21 02:27:42,811 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 27] could not be translated [2023-12-21 02:27:42,811 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 27] could not be translated [2023-12-21 02:27:42,811 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset] could not be translated [2023-12-21 02:27:42,812 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset] could not be translated [2023-12-21 02:27:42,812 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated [2023-12-21 02:27:42,812 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated [2023-12-21 02:27:42,812 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated [2023-12-21 02:27:42,812 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][23 + ~#WrapperStruct00~0!offset] could not be translated [2023-12-21 02:27:42,812 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated [2023-12-21 02:27:42,812 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated [2023-12-21 02:27:42,812 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated [2023-12-21 02:27:42,812 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][23 + ~#WrapperStruct00~0!offset] could not be translated [2023-12-21 02:27:42,812 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated [2023-12-21 02:27:42,812 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated [2023-12-21 02:27:42,812 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 28] could not be translated [2023-12-21 02:27:42,812 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 28] could not be translated [2023-12-21 02:27:42,813 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 27] could not be translated [2023-12-21 02:27:42,813 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 27] could not be translated [2023-12-21 02:27:42,813 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 6] could not be translated [2023-12-21 02:27:42,813 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset] could not be translated [2023-12-21 02:27:42,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:27:42 BoogieIcfgContainer [2023-12-21 02:27:42,813 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:27:42,814 INFO L158 Benchmark]: Toolchain (without parser) took 16068.46ms. Allocated memory was 280.0MB in the beginning and 724.6MB in the end (delta: 444.6MB). Free memory was 241.0MB in the beginning and 288.4MB in the end (delta: -47.4MB). Peak memory consumption was 426.2MB. Max. memory is 8.0GB. [2023-12-21 02:27:42,814 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 177.2MB. Free memory is still 131.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:27:42,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.13ms. Allocated memory is still 280.0MB. Free memory was 241.0MB in the beginning and 225.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 02:27:42,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.90ms. Allocated memory is still 280.0MB. Free memory was 225.8MB in the beginning and 222.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:27:42,814 INFO L158 Benchmark]: Boogie Preprocessor took 61.77ms. Allocated memory is still 280.0MB. Free memory was 222.1MB in the beginning and 217.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:27:42,814 INFO L158 Benchmark]: RCFGBuilder took 578.14ms. Allocated memory is still 280.0MB. Free memory was 217.9MB in the beginning and 189.6MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-12-21 02:27:42,814 INFO L158 Benchmark]: TraceAbstraction took 15120.53ms. Allocated memory was 280.0MB in the beginning and 724.6MB in the end (delta: 444.6MB). Free memory was 189.1MB in the beginning and 288.4MB in the end (delta: -99.3MB). Peak memory consumption was 374.8MB. Max. memory is 8.0GB. [2023-12-21 02:27:42,815 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.57ms. Allocated memory is still 177.2MB. Free memory is still 131.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.13ms. Allocated memory is still 280.0MB. Free memory was 241.0MB in the beginning and 225.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.90ms. Allocated memory is still 280.0MB. Free memory was 225.8MB in the beginning and 222.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.77ms. Allocated memory is still 280.0MB. Free memory was 222.1MB in the beginning and 217.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 578.14ms. Allocated memory is still 280.0MB. Free memory was 217.9MB in the beginning and 189.6MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 15120.53ms. Allocated memory was 280.0MB in the beginning and 724.6MB in the end (delta: 444.6MB). Free memory was 189.1MB in the beginning and 288.4MB in the end (delta: -99.3MB). Peak memory consumption was 374.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 25] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 28] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 28] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 27] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 27] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][23 + ~#WrapperStruct00~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][23 + ~#WrapperStruct00~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 28] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 28] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 27] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 27] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset] could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 21, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2296 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2279 mSDsluCounter, 9109 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6534 mSDsCounter, 348 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4826 IncrementalHoareTripleChecker+Invalid, 5174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 348 mSolverCounterUnsat, 2575 mSDtfsCounter, 4826 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1155 GetRequests, 1001 SyntacticMatches, 11 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=521occurred in iteration=18, InterpolantAutomatonStates: 160, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 700 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 632 PreInvPairs, 684 NumberOfFragments, 1404 HoareAnnotationTreeSize, 632 FormulaSimplifications, 224400 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 17 FormulaSimplificationsInter, 58405 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 2677 NumberOfCodeBlocks, 2677 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2781 ConstructedInterpolants, 0 QuantifiedInterpolants, 9915 SizeOfPredicates, 7 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 9579/9660 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-21 02:27:42,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...