/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:31:07,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:31:07,306 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-15 21:31:07,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:31:07,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:31:07,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:31:07,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:31:07,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:31:07,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:31:07,341 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:31:07,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:31:07,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:31:07,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:31:07,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:31:07,343 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:31:07,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:31:07,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:31:07,343 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:31:07,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:31:07,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:31:07,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:31:07,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:31:07,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:31:07,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:31:07,345 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:31:07,345 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:31:07,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:31:07,345 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:31:07,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:31:07,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:31:07,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:31:07,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:31:07,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:31:07,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:31:07,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:31:07,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:31:07,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:31:07,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:31:07,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:31:07,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:31:07,347 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:31:07,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:31:07,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:31:07,348 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:31:07,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:31:07,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:31:07,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:31:07,521 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:31:07,522 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:31:07,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i [2023-12-15 21:31:08,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:31:08,786 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:31:08,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i [2023-12-15 21:31:08,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0a7fd2d/284485633dd6416ba705487e87bbad16/FLAG54610913b [2023-12-15 21:31:08,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0a7fd2d/284485633dd6416ba705487e87bbad16 [2023-12-15 21:31:08,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:31:08,808 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:31:08,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:31:08,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:31:08,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:31:08,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:31:08" (1/1) ... [2023-12-15 21:31:08,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3984b03a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:08, skipping insertion in model container [2023-12-15 21:31:08,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:31:08" (1/1) ... [2023-12-15 21:31:08,840 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:31:08,967 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-a_file-66.i[916,929] [2023-12-15 21:31:09,022 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:31:09,032 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:31:09,039 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-a_file-66.i[916,929] [2023-12-15 21:31:09,122 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:31:09,133 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:31:09,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:09 WrapperNode [2023-12-15 21:31:09,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:31:09,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:31:09,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:31:09,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:31:09,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:09" (1/1) ... [2023-12-15 21:31:09,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:09" (1/1) ... [2023-12-15 21:31:09,202 INFO L138 Inliner]: procedures = 26, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 434 [2023-12-15 21:31:09,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:31:09,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:31:09,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:31:09,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:31:09,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:09" (1/1) ... [2023-12-15 21:31:09,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:09" (1/1) ... [2023-12-15 21:31:09,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:09" (1/1) ... [2023-12-15 21:31:09,247 INFO L175 MemorySlicer]: Split 123 memory accesses to 6 slices as follows [2, 8, 8, 73, 7, 25]. 59 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 6, 1, 3]. The 16 writes are split as follows [0, 1, 3, 7, 1, 4]. [2023-12-15 21:31:09,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:09" (1/1) ... [2023-12-15 21:31:09,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:09" (1/1) ... [2023-12-15 21:31:09,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:09" (1/1) ... [2023-12-15 21:31:09,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:09" (1/1) ... [2023-12-15 21:31:09,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:09" (1/1) ... [2023-12-15 21:31:09,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:09" (1/1) ... [2023-12-15 21:31:09,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:31:09,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:31:09,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:31:09,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:31:09,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:09" (1/1) ... [2023-12-15 21:31:09,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:31:09,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:31:09,323 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-15 21:31:09,345 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-15 21:31:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:31:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:31:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:31:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:31:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:31:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:31:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-15 21:31:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:31:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:31:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:31:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:31:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:31:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-15 21:31:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:31:09,352 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:31:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:31:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:31:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:31:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:31:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:31:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-15 21:31:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:31:09,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:31:09,460 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:31:09,462 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:31:09,843 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:31:09,874 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:31:09,875 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:31:09,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:31:09 BoogieIcfgContainer [2023-12-15 21:31:09,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:31:09,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:31:09,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:31:09,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:31:09,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:31:08" (1/3) ... [2023-12-15 21:31:09,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3782d1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:31:09, skipping insertion in model container [2023-12-15 21:31:09,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:09" (2/3) ... [2023-12-15 21:31:09,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3782d1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:31:09, skipping insertion in model container [2023-12-15 21:31:09,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:31:09" (3/3) ... [2023-12-15 21:31:09,883 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-66.i [2023-12-15 21:31:09,894 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:31:09,894 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:31:09,933 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:31:09,937 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;@4a19184c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:31:09,937 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:31:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 21:31:09,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 21:31:09,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:09,950 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:09,950 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:09,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:09,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1390896871, now seen corresponding path program 1 times [2023-12-15 21:31:09,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:09,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358772653] [2023-12-15 21:31:09,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:09,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:10,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:10,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358772653] [2023-12-15 21:31:10,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358772653] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:10,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:10,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:31:10,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743872141] [2023-12-15 21:31:10,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:10,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:31:10,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:10,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:31:10,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:31:10,319 INFO L87 Difference]: Start difference. First operand has 79 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:10,367 INFO L93 Difference]: Finished difference Result 155 states and 248 transitions. [2023-12-15 21:31:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:31:10,369 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 104 [2023-12-15 21:31:10,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:10,376 INFO L225 Difference]: With dead ends: 155 [2023-12-15 21:31:10,376 INFO L226 Difference]: Without dead ends: 77 [2023-12-15 21:31:10,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-15 21:31:10,382 INFO L413 NwaCegarLoop]: 109 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, 109 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-15 21:31:10,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:10,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-15 21:31:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-12-15 21:31:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 21:31:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 113 transitions. [2023-12-15 21:31:10,415 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 113 transitions. Word has length 104 [2023-12-15 21:31:10,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:10,415 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 113 transitions. [2023-12-15 21:31:10,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:10,415 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 113 transitions. [2023-12-15 21:31:10,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 21:31:10,418 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:10,418 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:10,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:31:10,419 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:10,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:10,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2012143819, now seen corresponding path program 1 times [2023-12-15 21:31:10,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:10,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854523109] [2023-12-15 21:31:10,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:10,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:10,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:10,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854523109] [2023-12-15 21:31:10,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854523109] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:10,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:10,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:31:10,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122145349] [2023-12-15 21:31:10,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:10,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:31:10,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:10,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:31:10,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:31:10,653 INFO L87 Difference]: Start difference. First operand 77 states and 113 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:10,694 INFO L93 Difference]: Finished difference Result 161 states and 236 transitions. [2023-12-15 21:31:10,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:31:10,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 104 [2023-12-15 21:31:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:10,696 INFO L225 Difference]: With dead ends: 161 [2023-12-15 21:31:10,696 INFO L226 Difference]: Without dead ends: 85 [2023-12-15 21:31:10,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:31:10,697 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 12 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:10,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 315 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-15 21:31:10,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2023-12-15 21:31:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 21:31:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2023-12-15 21:31:10,715 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 104 [2023-12-15 21:31:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:10,716 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2023-12-15 21:31:10,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:10,717 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2023-12-15 21:31:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 21:31:10,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:10,718 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:10,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:31:10,718 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:10,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:10,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2069402121, now seen corresponding path program 1 times [2023-12-15 21:31:10,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:10,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683055978] [2023-12-15 21:31:10,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:10,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:10,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:10,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683055978] [2023-12-15 21:31:10,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683055978] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:10,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:10,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:31:10,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31350190] [2023-12-15 21:31:10,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:10,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:31:10,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:10,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:31:10,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:31:10,960 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:11,005 INFO L93 Difference]: Finished difference Result 161 states and 234 transitions. [2023-12-15 21:31:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:31:11,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 104 [2023-12-15 21:31:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:11,007 INFO L225 Difference]: With dead ends: 161 [2023-12-15 21:31:11,007 INFO L226 Difference]: Without dead ends: 83 [2023-12-15 21:31:11,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:31:11,008 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 3 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:11,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 316 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:11,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-15 21:31:11,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2023-12-15 21:31:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 21:31:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2023-12-15 21:31:11,013 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 104 [2023-12-15 21:31:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:11,014 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2023-12-15 21:31:11,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2023-12-15 21:31:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 21:31:11,015 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:11,015 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:11,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:31:11,015 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:11,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:11,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2069461703, now seen corresponding path program 1 times [2023-12-15 21:31:11,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:11,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659937442] [2023-12-15 21:31:11,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:11,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:11,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:11,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659937442] [2023-12-15 21:31:11,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659937442] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:11,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:11,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:31:11,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930223056] [2023-12-15 21:31:11,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:11,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:31:11,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:11,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:31:11,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:31:11,582 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:11,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:11,737 INFO L93 Difference]: Finished difference Result 241 states and 349 transitions. [2023-12-15 21:31:11,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:31:11,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 104 [2023-12-15 21:31:11,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:11,739 INFO L225 Difference]: With dead ends: 241 [2023-12-15 21:31:11,739 INFO L226 Difference]: Without dead ends: 161 [2023-12-15 21:31:11,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:31:11,740 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 76 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:11,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 228 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-12-15 21:31:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2023-12-15 21:31:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 122 states have (on average 1.3524590163934427) internal successors, (165), 122 states have internal predecessors, (165), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-15 21:31:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2023-12-15 21:31:11,750 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 104 [2023-12-15 21:31:11,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:11,750 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2023-12-15 21:31:11,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2023-12-15 21:31:11,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-15 21:31:11,752 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:11,752 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:11,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:31:11,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:11,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:11,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1641233836, now seen corresponding path program 1 times [2023-12-15 21:31:11,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:11,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792293874] [2023-12-15 21:31:11,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:11,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:13,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:13,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792293874] [2023-12-15 21:31:13,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792293874] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:13,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:13,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-15 21:31:13,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452472113] [2023-12-15 21:31:13,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:13,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 21:31:13,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:13,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 21:31:13,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:31:13,672 INFO L87 Difference]: Start difference. First operand 153 states and 221 transitions. Second operand has 13 states, 10 states have (on average 3.8) internal successors, (38), 13 states have internal predecessors, (38), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-15 21:31:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:15,042 INFO L93 Difference]: Finished difference Result 422 states and 596 transitions. [2023-12-15 21:31:15,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 21:31:15,043 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.8) internal successors, (38), 13 states have internal predecessors, (38), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 105 [2023-12-15 21:31:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:15,044 INFO L225 Difference]: With dead ends: 422 [2023-12-15 21:31:15,044 INFO L226 Difference]: Without dead ends: 342 [2023-12-15 21:31:15,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2023-12-15 21:31:15,046 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 530 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:15,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 869 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 21:31:15,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-12-15 21:31:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 237. [2023-12-15 21:31:15,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 188 states have (on average 1.3297872340425532) internal successors, (250), 190 states have internal predecessors, (250), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-15 21:31:15,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 334 transitions. [2023-12-15 21:31:15,067 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 334 transitions. Word has length 105 [2023-12-15 21:31:15,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:15,068 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 334 transitions. [2023-12-15 21:31:15,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.8) internal successors, (38), 13 states have internal predecessors, (38), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-15 21:31:15,068 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 334 transitions. [2023-12-15 21:31:15,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-15 21:31:15,069 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:15,069 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:15,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:31:15,069 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:15,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:15,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1383068398, now seen corresponding path program 1 times [2023-12-15 21:31:15,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:15,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200861975] [2023-12-15 21:31:15,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:15,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,334 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:15,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:15,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200861975] [2023-12-15 21:31:15,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200861975] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:15,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:15,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:31:15,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084236078] [2023-12-15 21:31:15,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:15,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:31:15,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:15,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:31:15,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:15,335 INFO L87 Difference]: Start difference. First operand 237 states and 334 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:15,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:15,619 INFO L93 Difference]: Finished difference Result 499 states and 698 transitions. [2023-12-15 21:31:15,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:31:15,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 105 [2023-12-15 21:31:15,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:15,622 INFO L225 Difference]: With dead ends: 499 [2023-12-15 21:31:15,622 INFO L226 Difference]: Without dead ends: 343 [2023-12-15 21:31:15,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:31:15,623 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 247 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:15,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 262 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:31:15,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-12-15 21:31:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 237. [2023-12-15 21:31:15,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 190 states have (on average 1.331578947368421) internal successors, (253), 191 states have internal predecessors, (253), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:31:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 333 transitions. [2023-12-15 21:31:15,649 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 333 transitions. Word has length 105 [2023-12-15 21:31:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:15,650 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 333 transitions. [2023-12-15 21:31:15,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 333 transitions. [2023-12-15 21:31:15,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-15 21:31:15,651 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:15,651 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:15,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:31:15,651 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:15,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:15,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1632665106, now seen corresponding path program 1 times [2023-12-15 21:31:15,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:15,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681243157] [2023-12-15 21:31:15,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:15,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:15,856 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:15,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:15,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681243157] [2023-12-15 21:31:15,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681243157] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:15,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:15,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:31:15,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358581105] [2023-12-15 21:31:15,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:15,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:31:15,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:15,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:31:15,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:31:15,857 INFO L87 Difference]: Start difference. First operand 237 states and 333 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:16,077 INFO L93 Difference]: Finished difference Result 411 states and 570 transitions. [2023-12-15 21:31:16,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:31:16,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 105 [2023-12-15 21:31:16,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:16,079 INFO L225 Difference]: With dead ends: 411 [2023-12-15 21:31:16,079 INFO L226 Difference]: Without dead ends: 251 [2023-12-15 21:31:16,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:16,080 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 184 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:16,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 398 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:31:16,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-12-15 21:31:16,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 239. [2023-12-15 21:31:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 189 states have (on average 1.312169312169312) internal successors, (248), 190 states have internal predecessors, (248), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-15 21:31:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 332 transitions. [2023-12-15 21:31:16,102 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 332 transitions. Word has length 105 [2023-12-15 21:31:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:16,102 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 332 transitions. [2023-12-15 21:31:16,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 332 transitions. [2023-12-15 21:31:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-15 21:31:16,103 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:16,103 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:16,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:31:16,103 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:16,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:16,104 INFO L85 PathProgramCache]: Analyzing trace with hash 173160863, now seen corresponding path program 1 times [2023-12-15 21:31:16,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:16,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095020126] [2023-12-15 21:31:16,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:16,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:16,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:16,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095020126] [2023-12-15 21:31:16,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095020126] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:16,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:16,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:31:16,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964991012] [2023-12-15 21:31:16,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:16,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:31:16,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:16,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:31:16,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:16,293 INFO L87 Difference]: Start difference. First operand 239 states and 332 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:16,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:16,349 INFO L93 Difference]: Finished difference Result 518 states and 722 transitions. [2023-12-15 21:31:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:31:16,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 106 [2023-12-15 21:31:16,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:16,350 INFO L225 Difference]: With dead ends: 518 [2023-12-15 21:31:16,351 INFO L226 Difference]: Without dead ends: 280 [2023-12-15 21:31:16,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:16,351 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 71 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:16,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 544 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-12-15 21:31:16,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 244. [2023-12-15 21:31:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 194 states have (on average 1.309278350515464) internal successors, (254), 195 states have internal predecessors, (254), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-15 21:31:16,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 338 transitions. [2023-12-15 21:31:16,374 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 338 transitions. Word has length 106 [2023-12-15 21:31:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:16,374 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 338 transitions. [2023-12-15 21:31:16,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:16,374 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 338 transitions. [2023-12-15 21:31:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-15 21:31:16,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:16,375 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:16,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 21:31:16,375 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:16,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:16,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1106702815, now seen corresponding path program 1 times [2023-12-15 21:31:16,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:16,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512537348] [2023-12-15 21:31:16,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:16,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:17,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:17,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:17,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:17,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:17,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:17,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:17,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:17,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:17,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:17,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:17,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:17,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:17,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:17,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:17,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:17,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512537348] [2023-12-15 21:31:17,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512537348] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:17,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:17,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:31:17,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997387646] [2023-12-15 21:31:17,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:17,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:31:17,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:17,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:31:17,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:31:17,262 INFO L87 Difference]: Start difference. First operand 244 states and 338 transitions. Second operand has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 21:31:17,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:17,985 INFO L93 Difference]: Finished difference Result 631 states and 872 transitions. [2023-12-15 21:31:17,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-15 21:31:17,985 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 106 [2023-12-15 21:31:17,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:17,987 INFO L225 Difference]: With dead ends: 631 [2023-12-15 21:31:17,987 INFO L226 Difference]: Without dead ends: 388 [2023-12-15 21:31:17,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2023-12-15 21:31:17,988 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 527 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:17,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 578 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 21:31:17,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-12-15 21:31:18,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 314. [2023-12-15 21:31:18,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 250 states have (on average 1.304) internal successors, (326), 252 states have internal predecessors, (326), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-15 21:31:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 434 transitions. [2023-12-15 21:31:18,018 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 434 transitions. Word has length 106 [2023-12-15 21:31:18,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:18,018 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 434 transitions. [2023-12-15 21:31:18,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 21:31:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 434 transitions. [2023-12-15 21:31:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-15 21:31:18,020 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:18,020 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:18,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:31:18,020 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:18,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:18,021 INFO L85 PathProgramCache]: Analyzing trace with hash -848537377, now seen corresponding path program 1 times [2023-12-15 21:31:18,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:18,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620756242] [2023-12-15 21:31:18,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:18,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:18,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:18,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620756242] [2023-12-15 21:31:18,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620756242] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:18,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:18,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:31:18,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815024936] [2023-12-15 21:31:18,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:18,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:31:18,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:18,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:31:18,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:31:18,296 INFO L87 Difference]: Start difference. First operand 314 states and 434 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:18,406 INFO L93 Difference]: Finished difference Result 633 states and 875 transitions. [2023-12-15 21:31:18,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:31:18,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 106 [2023-12-15 21:31:18,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:18,408 INFO L225 Difference]: With dead ends: 633 [2023-12-15 21:31:18,408 INFO L226 Difference]: Without dead ends: 320 [2023-12-15 21:31:18,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:31:18,409 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 108 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:18,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 249 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:18,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-12-15 21:31:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 312. [2023-12-15 21:31:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 248 states have (on average 1.2943548387096775) internal successors, (321), 250 states have internal predecessors, (321), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-15 21:31:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 429 transitions. [2023-12-15 21:31:18,435 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 429 transitions. Word has length 106 [2023-12-15 21:31:18,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:18,435 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 429 transitions. [2023-12-15 21:31:18,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 429 transitions. [2023-12-15 21:31:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-15 21:31:18,436 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:18,436 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:18,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 21:31:18,436 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:18,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:18,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1194119775, now seen corresponding path program 1 times [2023-12-15 21:31:18,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:18,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897739395] [2023-12-15 21:31:18,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:18,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:18,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:18,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897739395] [2023-12-15 21:31:18,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897739395] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:18,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:18,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:31:18,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673209065] [2023-12-15 21:31:18,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:18,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:31:18,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:18,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:31:18,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:31:18,672 INFO L87 Difference]: Start difference. First operand 312 states and 429 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:18,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:18,829 INFO L93 Difference]: Finished difference Result 595 states and 817 transitions. [2023-12-15 21:31:18,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:31:18,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 106 [2023-12-15 21:31:18,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:18,831 INFO L225 Difference]: With dead ends: 595 [2023-12-15 21:31:18,831 INFO L226 Difference]: Without dead ends: 284 [2023-12-15 21:31:18,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:31:18,832 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 74 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:18,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 224 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:18,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-12-15 21:31:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 276. [2023-12-15 21:31:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 212 states have (on average 1.2688679245283019) internal successors, (269), 214 states have internal predecessors, (269), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-15 21:31:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 377 transitions. [2023-12-15 21:31:18,864 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 377 transitions. Word has length 106 [2023-12-15 21:31:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:18,864 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 377 transitions. [2023-12-15 21:31:18,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 377 transitions. [2023-12-15 21:31:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 21:31:18,865 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:18,865 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:18,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 21:31:18,865 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:18,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:18,866 INFO L85 PathProgramCache]: Analyzing trace with hash -242824702, now seen corresponding path program 1 times [2023-12-15 21:31:18,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:18,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337912679] [2023-12-15 21:31:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:18,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:18,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337912679] [2023-12-15 21:31:18,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337912679] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:18,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:18,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:31:18,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047046553] [2023-12-15 21:31:18,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:18,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:31:18,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:18,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:31:18,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:31:18,919 INFO L87 Difference]: Start difference. First operand 276 states and 377 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:18,959 INFO L93 Difference]: Finished difference Result 577 states and 789 transitions. [2023-12-15 21:31:18,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:31:18,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 108 [2023-12-15 21:31:18,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:18,961 INFO L225 Difference]: With dead ends: 577 [2023-12-15 21:31:18,961 INFO L226 Difference]: Without dead ends: 330 [2023-12-15 21:31:18,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-15 21:31:18,962 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 30 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 218 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-15 21:31:18,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 218 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:18,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2023-12-15 21:31:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 279. [2023-12-15 21:31:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 215 states have (on average 1.2651162790697674) internal successors, (272), 217 states have internal predecessors, (272), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-15 21:31:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 380 transitions. [2023-12-15 21:31:19,000 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 380 transitions. Word has length 108 [2023-12-15 21:31:19,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:19,000 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 380 transitions. [2023-12-15 21:31:19,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 380 transitions. [2023-12-15 21:31:19,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 21:31:19,001 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:19,001 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:19,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 21:31:19,001 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:19,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:19,002 INFO L85 PathProgramCache]: Analyzing trace with hash 15340736, now seen corresponding path program 1 times [2023-12-15 21:31:19,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:19,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693105072] [2023-12-15 21:31:19,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:19,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:19,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:19,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693105072] [2023-12-15 21:31:19,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693105072] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:19,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:19,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:31:19,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577584579] [2023-12-15 21:31:19,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:19,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:31:19,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:19,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:31:19,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:31:19,108 INFO L87 Difference]: Start difference. First operand 279 states and 380 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:19,160 INFO L93 Difference]: Finished difference Result 574 states and 783 transitions. [2023-12-15 21:31:19,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:31:19,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 108 [2023-12-15 21:31:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:19,163 INFO L225 Difference]: With dead ends: 574 [2023-12-15 21:31:19,163 INFO L226 Difference]: Without dead ends: 324 [2023-12-15 21:31:19,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:19,164 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 63 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:19,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 401 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:19,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2023-12-15 21:31:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 288. [2023-12-15 21:31:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 224 states have (on average 1.2544642857142858) internal successors, (281), 226 states have internal predecessors, (281), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-15 21:31:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 389 transitions. [2023-12-15 21:31:19,197 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 389 transitions. Word has length 108 [2023-12-15 21:31:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:19,197 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 389 transitions. [2023-12-15 21:31:19,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:19,198 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 389 transitions. [2023-12-15 21:31:19,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 21:31:19,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:19,198 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:19,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 21:31:19,198 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:19,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:19,199 INFO L85 PathProgramCache]: Analyzing trace with hash -922931083, now seen corresponding path program 1 times [2023-12-15 21:31:19,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:19,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162523465] [2023-12-15 21:31:19,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:19,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:20,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:20,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:20,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:20,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:20,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:20,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:20,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:20,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:20,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:20,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:20,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:20,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:20,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:20,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:20,932 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:20,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:20,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162523465] [2023-12-15 21:31:20,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162523465] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:20,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:20,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-15 21:31:20,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526076143] [2023-12-15 21:31:20,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:20,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-15 21:31:20,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:20,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-15 21:31:20,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:31:20,933 INFO L87 Difference]: Start difference. First operand 288 states and 389 transitions. Second operand has 15 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-15 21:31:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:24,223 INFO L93 Difference]: Finished difference Result 822 states and 1117 transitions. [2023-12-15 21:31:24,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-15 21:31:24,224 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 108 [2023-12-15 21:31:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:24,226 INFO L225 Difference]: With dead ends: 822 [2023-12-15 21:31:24,226 INFO L226 Difference]: Without dead ends: 647 [2023-12-15 21:31:24,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=1234, Unknown=0, NotChecked=0, Total=1482 [2023-12-15 21:31:24,227 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 672 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:24,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 1234 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-15 21:31:24,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2023-12-15 21:31:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 438. [2023-12-15 21:31:24,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 347 states have (on average 1.2737752161383284) internal successors, (442), 351 states have internal predecessors, (442), 76 states have call successors, (76), 14 states have call predecessors, (76), 14 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-15 21:31:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 594 transitions. [2023-12-15 21:31:24,264 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 594 transitions. Word has length 108 [2023-12-15 21:31:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:24,265 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 594 transitions. [2023-12-15 21:31:24,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-15 21:31:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 594 transitions. [2023-12-15 21:31:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 21:31:24,265 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:24,266 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:24,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 21:31:24,266 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:24,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:24,266 INFO L85 PathProgramCache]: Analyzing trace with hash -664765645, now seen corresponding path program 1 times [2023-12-15 21:31:24,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:24,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615164176] [2023-12-15 21:31:24,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:24,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:24,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:24,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615164176] [2023-12-15 21:31:24,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615164176] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:24,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:24,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:31:24,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567571620] [2023-12-15 21:31:24,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:24,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:31:24,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:24,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:31:24,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:31:24,667 INFO L87 Difference]: Start difference. First operand 438 states and 594 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:25,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:25,100 INFO L93 Difference]: Finished difference Result 853 states and 1161 transitions. [2023-12-15 21:31:25,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:31:25,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2023-12-15 21:31:25,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:25,102 INFO L225 Difference]: With dead ends: 853 [2023-12-15 21:31:25,102 INFO L226 Difference]: Without dead ends: 550 [2023-12-15 21:31:25,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:31:25,104 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 308 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:25,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 420 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:31:25,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2023-12-15 21:31:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 445. [2023-12-15 21:31:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 354 states have (on average 1.271186440677966) internal successors, (450), 358 states have internal predecessors, (450), 76 states have call successors, (76), 14 states have call predecessors, (76), 14 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-15 21:31:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 602 transitions. [2023-12-15 21:31:25,166 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 602 transitions. Word has length 108 [2023-12-15 21:31:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:25,166 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 602 transitions. [2023-12-15 21:31:25,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 602 transitions. [2023-12-15 21:31:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 21:31:25,167 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:25,168 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:25,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 21:31:25,168 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:25,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:25,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1943999437, now seen corresponding path program 1 times [2023-12-15 21:31:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:25,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8066426] [2023-12-15 21:31:25,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:25,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:25,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:25,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:25,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:25,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:25,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:25,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:25,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:25,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:25,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:25,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:25,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:25,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:25,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:25,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:25,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:25,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8066426] [2023-12-15 21:31:25,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8066426] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:25,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:25,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:31:25,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651636017] [2023-12-15 21:31:25,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:25,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:31:25,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:25,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:31:25,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:31:25,484 INFO L87 Difference]: Start difference. First operand 445 states and 602 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:26,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:26,104 INFO L93 Difference]: Finished difference Result 834 states and 1133 transitions. [2023-12-15 21:31:26,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:31:26,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 108 [2023-12-15 21:31:26,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:26,107 INFO L225 Difference]: With dead ends: 834 [2023-12-15 21:31:26,107 INFO L226 Difference]: Without dead ends: 650 [2023-12-15 21:31:26,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:31:26,107 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 356 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:26,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 639 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:31:26,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2023-12-15 21:31:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 465. [2023-12-15 21:31:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 371 states have (on average 1.274932614555256) internal successors, (473), 375 states have internal predecessors, (473), 78 states have call successors, (78), 15 states have call predecessors, (78), 15 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2023-12-15 21:31:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 629 transitions. [2023-12-15 21:31:26,160 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 629 transitions. Word has length 108 [2023-12-15 21:31:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:26,160 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 629 transitions. [2023-12-15 21:31:26,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 629 transitions. [2023-12-15 21:31:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 21:31:26,162 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:26,162 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:26,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 21:31:26,162 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:26,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1685833999, now seen corresponding path program 1 times [2023-12-15 21:31:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:26,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920787233] [2023-12-15 21:31:26,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:26,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:26,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:26,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:26,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:26,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:26,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:26,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:26,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:26,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:26,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:26,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:26,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:26,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:26,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:26,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:26,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:26,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920787233] [2023-12-15 21:31:26,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920787233] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:26,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:26,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:31:26,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912063692] [2023-12-15 21:31:26,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:26,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:31:26,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:26,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:31:26,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:31:26,539 INFO L87 Difference]: Start difference. First operand 465 states and 629 transitions. Second operand has 8 states, 6 states have (on average 6.833333333333333) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 21:31:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:26,775 INFO L93 Difference]: Finished difference Result 758 states and 1030 transitions. [2023-12-15 21:31:26,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:31:26,775 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.833333333333333) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 108 [2023-12-15 21:31:26,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:26,777 INFO L225 Difference]: With dead ends: 758 [2023-12-15 21:31:26,777 INFO L226 Difference]: Without dead ends: 562 [2023-12-15 21:31:26,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:31:26,780 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 149 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:26,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1071 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:31:26,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2023-12-15 21:31:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 467. [2023-12-15 21:31:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 373 states have (on average 1.2734584450402144) internal successors, (475), 377 states have internal predecessors, (475), 78 states have call successors, (78), 15 states have call predecessors, (78), 15 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2023-12-15 21:31:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 631 transitions. [2023-12-15 21:31:26,829 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 631 transitions. Word has length 108 [2023-12-15 21:31:26,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:26,829 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 631 transitions. [2023-12-15 21:31:26,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.833333333333333) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 21:31:26,829 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 631 transitions. [2023-12-15 21:31:26,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 21:31:26,830 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:26,830 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:26,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 21:31:26,830 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:26,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:26,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1740579533, now seen corresponding path program 1 times [2023-12-15 21:31:26,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:26,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777215185] [2023-12-15 21:31:26,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:26,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:27,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:27,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:27,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:27,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:27,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:27,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:27,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:27,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:27,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:27,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:27,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:27,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:27,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:27,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:27,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777215185] [2023-12-15 21:31:27,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777215185] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:27,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:27,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-15 21:31:27,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144276989] [2023-12-15 21:31:27,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:27,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-15 21:31:27,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:27,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-15 21:31:27,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:31:27,881 INFO L87 Difference]: Start difference. First operand 467 states and 631 transitions. Second operand has 14 states, 11 states have (on average 3.727272727272727) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-15 21:31:30,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:30,843 INFO L93 Difference]: Finished difference Result 967 states and 1310 transitions. [2023-12-15 21:31:30,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-15 21:31:30,843 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 3.727272727272727) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 108 [2023-12-15 21:31:30,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:30,845 INFO L225 Difference]: With dead ends: 967 [2023-12-15 21:31:30,845 INFO L226 Difference]: Without dead ends: 707 [2023-12-15 21:31:30,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=197, Invalid=859, Unknown=0, NotChecked=0, Total=1056 [2023-12-15 21:31:30,847 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 519 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:30,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1169 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-15 21:31:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2023-12-15 21:31:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 475. [2023-12-15 21:31:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 381 states have (on average 1.2755905511811023) internal successors, (486), 385 states have internal predecessors, (486), 78 states have call successors, (78), 15 states have call predecessors, (78), 15 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2023-12-15 21:31:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 642 transitions. [2023-12-15 21:31:30,897 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 642 transitions. Word has length 108 [2023-12-15 21:31:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:30,897 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 642 transitions. [2023-12-15 21:31:30,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 3.727272727272727) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-15 21:31:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 642 transitions. [2023-12-15 21:31:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 21:31:30,898 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:30,898 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:30,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 21:31:30,898 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:30,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:30,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1533319409, now seen corresponding path program 1 times [2023-12-15 21:31:30,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:30,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246099957] [2023-12-15 21:31:30,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:30,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:31,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:31,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246099957] [2023-12-15 21:31:31,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246099957] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:31,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:31,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:31:31,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93467679] [2023-12-15 21:31:31,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:31,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:31:31,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:31,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:31:31,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:31,113 INFO L87 Difference]: Start difference. First operand 475 states and 642 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:31,468 INFO L93 Difference]: Finished difference Result 810 states and 1096 transitions. [2023-12-15 21:31:31,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:31:31,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 108 [2023-12-15 21:31:31,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:31,471 INFO L225 Difference]: With dead ends: 810 [2023-12-15 21:31:31,471 INFO L226 Difference]: Without dead ends: 550 [2023-12-15 21:31:31,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:31:31,472 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 202 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:31,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 425 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:31:31,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2023-12-15 21:31:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 535. [2023-12-15 21:31:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 424 states have (on average 1.2617924528301887) internal successors, (535), 429 states have internal predecessors, (535), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2023-12-15 21:31:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 719 transitions. [2023-12-15 21:31:31,539 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 719 transitions. Word has length 108 [2023-12-15 21:31:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:31,539 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 719 transitions. [2023-12-15 21:31:31,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 719 transitions. [2023-12-15 21:31:31,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 21:31:31,540 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:31,541 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:31,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 21:31:31,541 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:31,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:31,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2138828573, now seen corresponding path program 1 times [2023-12-15 21:31:31,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:31,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613543046] [2023-12-15 21:31:31,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:31,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:31,815 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:31,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:31,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613543046] [2023-12-15 21:31:31,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613543046] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:31,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:31,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:31:31,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884053551] [2023-12-15 21:31:31,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:31,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:31:31,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:31,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:31:31,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:31:31,816 INFO L87 Difference]: Start difference. First operand 535 states and 719 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:32,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:32,068 INFO L93 Difference]: Finished difference Result 883 states and 1193 transitions. [2023-12-15 21:31:32,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 21:31:32,069 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2023-12-15 21:31:32,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:32,071 INFO L225 Difference]: With dead ends: 883 [2023-12-15 21:31:32,071 INFO L226 Difference]: Without dead ends: 625 [2023-12-15 21:31:32,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2023-12-15 21:31:32,072 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 206 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:32,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 596 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2023-12-15 21:31:32,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 536. [2023-12-15 21:31:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 425 states have (on average 1.2611764705882353) internal successors, (536), 430 states have internal predecessors, (536), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2023-12-15 21:31:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 720 transitions. [2023-12-15 21:31:32,139 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 720 transitions. Word has length 110 [2023-12-15 21:31:32,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:32,140 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 720 transitions. [2023-12-15 21:31:32,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 720 transitions. [2023-12-15 21:31:32,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 21:31:32,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:32,141 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:32,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 21:31:32,141 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:32,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:32,142 INFO L85 PathProgramCache]: Analyzing trace with hash 454207881, now seen corresponding path program 1 times [2023-12-15 21:31:32,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:32,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727176810] [2023-12-15 21:31:32,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:32,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:32,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:32,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:32,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:32,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:32,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:32,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:32,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:32,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:32,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:32,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:32,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:32,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:32,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:32,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:32,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:32,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727176810] [2023-12-15 21:31:32,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727176810] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:32,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:32,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:31:32,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739566989] [2023-12-15 21:31:32,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:32,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:31:32,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:32,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:31:32,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:31:32,610 INFO L87 Difference]: Start difference. First operand 536 states and 720 transitions. Second operand has 8 states, 6 states have (on average 7.166666666666667) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 21:31:32,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:32,902 INFO L93 Difference]: Finished difference Result 1027 states and 1388 transitions. [2023-12-15 21:31:32,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:31:32,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.166666666666667) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 110 [2023-12-15 21:31:32,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:32,906 INFO L225 Difference]: With dead ends: 1027 [2023-12-15 21:31:32,906 INFO L226 Difference]: Without dead ends: 674 [2023-12-15 21:31:32,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:31:32,907 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 177 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:32,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 520 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:31:32,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2023-12-15 21:31:32,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 539. [2023-12-15 21:31:32,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 428 states have (on average 1.264018691588785) internal successors, (541), 433 states have internal predecessors, (541), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2023-12-15 21:31:32,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 725 transitions. [2023-12-15 21:31:32,971 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 725 transitions. Word has length 110 [2023-12-15 21:31:32,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:32,972 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 725 transitions. [2023-12-15 21:31:32,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.166666666666667) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 21:31:32,972 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 725 transitions. [2023-12-15 21:31:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 21:31:32,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:32,973 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:32,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-15 21:31:32,973 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:32,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:32,973 INFO L85 PathProgramCache]: Analyzing trace with hash 2111781837, now seen corresponding path program 1 times [2023-12-15 21:31:32,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:32,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75609784] [2023-12-15 21:31:32,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:32,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:36,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:36,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:36,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:36,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:36,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:36,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:36,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:36,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:36,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:37,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:37,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:37,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:37,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:37,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:37,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:37,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75609784] [2023-12-15 21:31:37,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75609784] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:37,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:37,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-15 21:31:37,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134570682] [2023-12-15 21:31:37,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:37,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-15 21:31:37,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:37,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-15 21:31:37,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:31:37,019 INFO L87 Difference]: Start difference. First operand 539 states and 725 transitions. Second operand has 14 states, 10 states have (on average 4.3) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-15 21:31:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:38,326 INFO L93 Difference]: Finished difference Result 999 states and 1334 transitions. [2023-12-15 21:31:38,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-15 21:31:38,327 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 4.3) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) Word has length 110 [2023-12-15 21:31:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:38,329 INFO L225 Difference]: With dead ends: 999 [2023-12-15 21:31:38,329 INFO L226 Difference]: Without dead ends: 683 [2023-12-15 21:31:38,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2023-12-15 21:31:38,332 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 572 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:38,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1051 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 21:31:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2023-12-15 21:31:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 490. [2023-12-15 21:31:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 390 states have (on average 1.2615384615384615) internal successors, (492), 394 states have internal predecessors, (492), 82 states have call successors, (82), 17 states have call predecessors, (82), 17 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:31:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 656 transitions. [2023-12-15 21:31:38,402 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 656 transitions. Word has length 110 [2023-12-15 21:31:38,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:38,402 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 656 transitions. [2023-12-15 21:31:38,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 4.3) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-15 21:31:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 656 transitions. [2023-12-15 21:31:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-15 21:31:38,403 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:38,403 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:38,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-15 21:31:38,404 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:38,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:38,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1114110832, now seen corresponding path program 1 times [2023-12-15 21:31:38,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:38,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422702636] [2023-12-15 21:31:38,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:38,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:38,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:38,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:38,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:38,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:38,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:38,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:38,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:38,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:38,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:38,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:38,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:38,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:38,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:38,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:38,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:38,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422702636] [2023-12-15 21:31:38,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422702636] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:38,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:38,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:31:38,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093130666] [2023-12-15 21:31:38,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:38,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:31:38,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:38,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:31:38,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:31:38,672 INFO L87 Difference]: Start difference. First operand 490 states and 656 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:39,100 INFO L93 Difference]: Finished difference Result 1059 states and 1423 transitions. [2023-12-15 21:31:39,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:31:39,100 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2023-12-15 21:31:39,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:39,102 INFO L225 Difference]: With dead ends: 1059 [2023-12-15 21:31:39,102 INFO L226 Difference]: Without dead ends: 610 [2023-12-15 21:31:39,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:31:39,103 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 273 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:39,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 601 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:31:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2023-12-15 21:31:39,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 489. [2023-12-15 21:31:39,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 389 states have (on average 1.2596401028277635) internal successors, (490), 393 states have internal predecessors, (490), 82 states have call successors, (82), 17 states have call predecessors, (82), 17 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:31:39,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 654 transitions. [2023-12-15 21:31:39,170 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 654 transitions. Word has length 111 [2023-12-15 21:31:39,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:39,170 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 654 transitions. [2023-12-15 21:31:39,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 654 transitions. [2023-12-15 21:31:39,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-15 21:31:39,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:39,172 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:39,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-15 21:31:39,172 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:39,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:39,172 INFO L85 PathProgramCache]: Analyzing trace with hash 102993582, now seen corresponding path program 1 times [2023-12-15 21:31:39,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:39,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135262402] [2023-12-15 21:31:39,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:39,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:39,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:39,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135262402] [2023-12-15 21:31:39,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135262402] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:39,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:39,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:31:39,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740991327] [2023-12-15 21:31:39,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:39,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:31:39,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:39,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:31:39,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:39,365 INFO L87 Difference]: Start difference. First operand 489 states and 654 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:39,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:39,466 INFO L93 Difference]: Finished difference Result 1007 states and 1352 transitions. [2023-12-15 21:31:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:31:39,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2023-12-15 21:31:39,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:39,468 INFO L225 Difference]: With dead ends: 1007 [2023-12-15 21:31:39,469 INFO L226 Difference]: Without dead ends: 559 [2023-12-15 21:31:39,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:39,470 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 159 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:39,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 477 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2023-12-15 21:31:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 477. [2023-12-15 21:31:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 377 states have (on average 1.246684350132626) internal successors, (470), 381 states have internal predecessors, (470), 82 states have call successors, (82), 17 states have call predecessors, (82), 17 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:31:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 634 transitions. [2023-12-15 21:31:39,536 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 634 transitions. Word has length 111 [2023-12-15 21:31:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:39,536 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 634 transitions. [2023-12-15 21:31:39,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 634 transitions. [2023-12-15 21:31:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-15 21:31:39,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:39,537 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:39,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-15 21:31:39,537 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:39,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash -570509860, now seen corresponding path program 1 times [2023-12-15 21:31:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:39,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788221440] [2023-12-15 21:31:39,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:39,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:39,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:39,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788221440] [2023-12-15 21:31:39,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788221440] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:39,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:39,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:31:39,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115299559] [2023-12-15 21:31:39,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:39,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:31:39,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:39,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:31:39,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:31:39,760 INFO L87 Difference]: Start difference. First operand 477 states and 634 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:39,904 INFO L93 Difference]: Finished difference Result 915 states and 1217 transitions. [2023-12-15 21:31:39,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:31:39,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2023-12-15 21:31:39,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:39,906 INFO L225 Difference]: With dead ends: 915 [2023-12-15 21:31:39,907 INFO L226 Difference]: Without dead ends: 479 [2023-12-15 21:31:39,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:31:39,908 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 59 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:39,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 258 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2023-12-15 21:31:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2023-12-15 21:31:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 377 states have (on average 1.2440318302387268) internal successors, (469), 381 states have internal predecessors, (469), 82 states have call successors, (82), 17 states have call predecessors, (82), 17 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:31:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 633 transitions. [2023-12-15 21:31:39,986 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 633 transitions. Word has length 111 [2023-12-15 21:31:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:39,986 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 633 transitions. [2023-12-15 21:31:39,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 633 transitions. [2023-12-15 21:31:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 21:31:39,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:39,987 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:39,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-15 21:31:39,987 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:39,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:39,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1016553638, now seen corresponding path program 1 times [2023-12-15 21:31:39,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:39,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247772409] [2023-12-15 21:31:39,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:39,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:40,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:40,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:40,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:40,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:40,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:40,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:40,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:40,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:40,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:40,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:40,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:40,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:40,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:40,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:40,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:40,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247772409] [2023-12-15 21:31:40,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247772409] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:40,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:40,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-15 21:31:40,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041309311] [2023-12-15 21:31:40,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:40,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 21:31:40,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:40,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 21:31:40,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:31:40,880 INFO L87 Difference]: Start difference. First operand 477 states and 633 transitions. Second operand has 12 states, 10 states have (on average 4.5) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 21:31:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:41,541 INFO L93 Difference]: Finished difference Result 576 states and 760 transitions. [2023-12-15 21:31:41,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 21:31:41,542 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.5) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 112 [2023-12-15 21:31:41,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:41,543 INFO L225 Difference]: With dead ends: 576 [2023-12-15 21:31:41,544 INFO L226 Difference]: Without dead ends: 574 [2023-12-15 21:31:41,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2023-12-15 21:31:41,544 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 211 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:41,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 758 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:31:41,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2023-12-15 21:31:41,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 487. [2023-12-15 21:31:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 387 states have (on average 1.2377260981912144) internal successors, (479), 391 states have internal predecessors, (479), 82 states have call successors, (82), 17 states have call predecessors, (82), 17 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:31:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 643 transitions. [2023-12-15 21:31:41,608 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 643 transitions. Word has length 112 [2023-12-15 21:31:41,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:41,608 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 643 transitions. [2023-12-15 21:31:41,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.5) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 21:31:41,608 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 643 transitions. [2023-12-15 21:31:41,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 21:31:41,609 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:41,609 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:41,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-15 21:31:41,609 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:41,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1016613220, now seen corresponding path program 1 times [2023-12-15 21:31:41,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:41,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111846429] [2023-12-15 21:31:41,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:41,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:42,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:42,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111846429] [2023-12-15 21:31:42,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111846429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:42,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:42,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:31:42,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785013856] [2023-12-15 21:31:42,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:42,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:31:42,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:42,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:31:42,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:31:42,050 INFO L87 Difference]: Start difference. First operand 487 states and 643 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:42,473 INFO L93 Difference]: Finished difference Result 1203 states and 1577 transitions. [2023-12-15 21:31:42,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:31:42,474 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2023-12-15 21:31:42,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:42,477 INFO L225 Difference]: With dead ends: 1203 [2023-12-15 21:31:42,477 INFO L226 Difference]: Without dead ends: 757 [2023-12-15 21:31:42,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:31:42,478 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 305 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:42,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 503 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:31:42,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2023-12-15 21:31:42,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 507. [2023-12-15 21:31:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 402 states have (on average 1.2164179104477613) internal successors, (489), 406 states have internal predecessors, (489), 82 states have call successors, (82), 22 states have call predecessors, (82), 22 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:31:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 653 transitions. [2023-12-15 21:31:42,553 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 653 transitions. Word has length 112 [2023-12-15 21:31:42,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:42,554 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 653 transitions. [2023-12-15 21:31:42,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:42,554 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 653 transitions. [2023-12-15 21:31:42,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 21:31:42,555 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:42,555 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:42,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-15 21:31:42,555 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:42,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:42,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1073871522, now seen corresponding path program 1 times [2023-12-15 21:31:42,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:42,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824255442] [2023-12-15 21:31:42,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:42,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:42,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:42,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824255442] [2023-12-15 21:31:42,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824255442] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:42,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:42,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:31:42,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948794737] [2023-12-15 21:31:42,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:42,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:31:42,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:42,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:31:42,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:31:42,860 INFO L87 Difference]: Start difference. First operand 507 states and 653 transitions. Second operand has 8 states, 6 states have (on average 7.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 21:31:43,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:43,113 INFO L93 Difference]: Finished difference Result 1054 states and 1352 transitions. [2023-12-15 21:31:43,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:31:43,114 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 112 [2023-12-15 21:31:43,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:43,116 INFO L225 Difference]: With dead ends: 1054 [2023-12-15 21:31:43,116 INFO L226 Difference]: Without dead ends: 766 [2023-12-15 21:31:43,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:31:43,117 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 94 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:43,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 869 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2023-12-15 21:31:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 699. [2023-12-15 21:31:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 563 states have (on average 1.2131438721136767) internal successors, (683), 569 states have internal predecessors, (683), 106 states have call successors, (106), 29 states have call predecessors, (106), 29 states have return successors, (106), 100 states have call predecessors, (106), 106 states have call successors, (106) [2023-12-15 21:31:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 895 transitions. [2023-12-15 21:31:43,214 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 895 transitions. Word has length 112 [2023-12-15 21:31:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:43,214 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 895 transitions. [2023-12-15 21:31:43,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 21:31:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 895 transitions. [2023-12-15 21:31:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 21:31:43,215 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:43,215 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:43,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-15 21:31:43,215 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:43,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:43,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1845075430, now seen corresponding path program 1 times [2023-12-15 21:31:43,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:43,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847205185] [2023-12-15 21:31:43,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:43,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:43,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:43,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:43,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:43,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:43,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:43,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:43,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:43,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:43,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:43,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:43,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:43,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:43,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:43,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:43,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:43,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847205185] [2023-12-15 21:31:43,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847205185] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:43,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:43,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:31:43,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015407051] [2023-12-15 21:31:43,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:43,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:31:43,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:43,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:31:43,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:31:43,564 INFO L87 Difference]: Start difference. First operand 699 states and 895 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:44,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:44,049 INFO L93 Difference]: Finished difference Result 1518 states and 1942 transitions. [2023-12-15 21:31:44,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:31:44,049 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2023-12-15 21:31:44,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:44,052 INFO L225 Difference]: With dead ends: 1518 [2023-12-15 21:31:44,052 INFO L226 Difference]: Without dead ends: 971 [2023-12-15 21:31:44,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:31:44,053 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 213 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:44,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 539 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:31:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2023-12-15 21:31:44,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 741. [2023-12-15 21:31:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 605 states have (on average 1.2148760330578512) internal successors, (735), 611 states have internal predecessors, (735), 106 states have call successors, (106), 29 states have call predecessors, (106), 29 states have return successors, (106), 100 states have call predecessors, (106), 106 states have call successors, (106) [2023-12-15 21:31:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 947 transitions. [2023-12-15 21:31:44,189 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 947 transitions. Word has length 113 [2023-12-15 21:31:44,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:44,189 INFO L495 AbstractCegarLoop]: Abstraction has 741 states and 947 transitions. [2023-12-15 21:31:44,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 947 transitions. [2023-12-15 21:31:44,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 21:31:44,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:44,190 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:44,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-15 21:31:44,190 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:44,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:44,190 INFO L85 PathProgramCache]: Analyzing trace with hash 256727528, now seen corresponding path program 1 times [2023-12-15 21:31:44,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:44,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947548673] [2023-12-15 21:31:44,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:44,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:44,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:44,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:44,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:44,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:44,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:44,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:44,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:44,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:44,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:44,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:44,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:44,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:44,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:44,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:44,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:44,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947548673] [2023-12-15 21:31:44,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947548673] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:44,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:44,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:31:44,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095868106] [2023-12-15 21:31:44,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:44,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:31:44,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:44,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:31:44,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:31:44,511 INFO L87 Difference]: Start difference. First operand 741 states and 947 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:44,980 INFO L93 Difference]: Finished difference Result 1351 states and 1726 transitions. [2023-12-15 21:31:44,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 21:31:44,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2023-12-15 21:31:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:44,987 INFO L225 Difference]: With dead ends: 1351 [2023-12-15 21:31:44,987 INFO L226 Difference]: Without dead ends: 871 [2023-12-15 21:31:44,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:31:44,989 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 324 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:44,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 492 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:31:44,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2023-12-15 21:31:45,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 741. [2023-12-15 21:31:45,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 605 states have (on average 1.2115702479338843) internal successors, (733), 611 states have internal predecessors, (733), 106 states have call successors, (106), 29 states have call predecessors, (106), 29 states have return successors, (106), 100 states have call predecessors, (106), 106 states have call successors, (106) [2023-12-15 21:31:45,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 945 transitions. [2023-12-15 21:31:45,103 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 945 transitions. Word has length 113 [2023-12-15 21:31:45,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:45,103 INFO L495 AbstractCegarLoop]: Abstraction has 741 states and 945 transitions. [2023-12-15 21:31:45,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:45,103 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 945 transitions. [2023-12-15 21:31:45,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 21:31:45,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:45,104 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:45,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-15 21:31:45,104 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:45,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:45,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2079314532, now seen corresponding path program 1 times [2023-12-15 21:31:45,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:45,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513095593] [2023-12-15 21:31:45,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:45,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:45,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:45,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:45,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:45,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:45,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:45,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:45,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:45,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:45,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:45,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:45,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:45,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:45,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:45,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:45,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:45,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513095593] [2023-12-15 21:31:45,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513095593] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:45,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:45,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:31:45,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598603973] [2023-12-15 21:31:45,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:45,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:31:45,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:45,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:31:45,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:31:45,375 INFO L87 Difference]: Start difference. First operand 741 states and 945 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:45,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:45,747 INFO L93 Difference]: Finished difference Result 1412 states and 1799 transitions. [2023-12-15 21:31:45,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:31:45,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2023-12-15 21:31:45,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:45,750 INFO L225 Difference]: With dead ends: 1412 [2023-12-15 21:31:45,750 INFO L226 Difference]: Without dead ends: 862 [2023-12-15 21:31:45,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:31:45,751 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 271 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:45,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 475 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:31:45,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2023-12-15 21:31:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 733. [2023-12-15 21:31:45,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 597 states have (on average 1.2077051926298157) internal successors, (721), 603 states have internal predecessors, (721), 106 states have call successors, (106), 29 states have call predecessors, (106), 29 states have return successors, (106), 100 states have call predecessors, (106), 106 states have call successors, (106) [2023-12-15 21:31:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 933 transitions. [2023-12-15 21:31:45,849 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 933 transitions. Word has length 113 [2023-12-15 21:31:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:45,850 INFO L495 AbstractCegarLoop]: Abstraction has 733 states and 933 transitions. [2023-12-15 21:31:45,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 933 transitions. [2023-12-15 21:31:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 21:31:45,850 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:45,850 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:45,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-15 21:31:45,851 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:45,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:45,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1204535514, now seen corresponding path program 1 times [2023-12-15 21:31:45,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:45,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023386173] [2023-12-15 21:31:45,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:45,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:46,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:46,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023386173] [2023-12-15 21:31:46,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023386173] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:46,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:46,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:31:46,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806359817] [2023-12-15 21:31:46,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:46,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:31:46,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:46,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:31:46,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:31:46,151 INFO L87 Difference]: Start difference. First operand 733 states and 933 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:46,617 INFO L93 Difference]: Finished difference Result 1405 states and 1788 transitions. [2023-12-15 21:31:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:31:46,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2023-12-15 21:31:46,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:46,620 INFO L225 Difference]: With dead ends: 1405 [2023-12-15 21:31:46,620 INFO L226 Difference]: Without dead ends: 863 [2023-12-15 21:31:46,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:31:46,622 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 221 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:46,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 504 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:31:46,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2023-12-15 21:31:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 737. [2023-12-15 21:31:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 601 states have (on average 1.2029950083194676) internal successors, (723), 607 states have internal predecessors, (723), 106 states have call successors, (106), 29 states have call predecessors, (106), 29 states have return successors, (106), 100 states have call predecessors, (106), 106 states have call successors, (106) [2023-12-15 21:31:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 935 transitions. [2023-12-15 21:31:46,737 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 935 transitions. Word has length 113 [2023-12-15 21:31:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:46,738 INFO L495 AbstractCegarLoop]: Abstraction has 737 states and 935 transitions. [2023-12-15 21:31:46,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 935 transitions. [2023-12-15 21:31:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 21:31:46,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:46,738 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:46,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-15 21:31:46,739 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:46,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:46,739 INFO L85 PathProgramCache]: Analyzing trace with hash 844055378, now seen corresponding path program 1 times [2023-12-15 21:31:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:46,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184795584] [2023-12-15 21:31:46,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:46,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:46,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:46,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184795584] [2023-12-15 21:31:46,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184795584] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:46,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:46,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:31:46,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802201812] [2023-12-15 21:31:46,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:46,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:31:46,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:46,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:31:46,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:46,883 INFO L87 Difference]: Start difference. First operand 737 states and 935 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:47,019 INFO L93 Difference]: Finished difference Result 1671 states and 2106 transitions. [2023-12-15 21:31:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:31:47,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2023-12-15 21:31:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:47,022 INFO L225 Difference]: With dead ends: 1671 [2023-12-15 21:31:47,022 INFO L226 Difference]: Without dead ends: 975 [2023-12-15 21:31:47,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:47,024 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 74 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:47,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 599 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:47,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2023-12-15 21:31:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 789. [2023-12-15 21:31:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 653 states have (on average 1.222052067381317) internal successors, (798), 659 states have internal predecessors, (798), 106 states have call successors, (106), 29 states have call predecessors, (106), 29 states have return successors, (106), 100 states have call predecessors, (106), 106 states have call successors, (106) [2023-12-15 21:31:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1010 transitions. [2023-12-15 21:31:47,122 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1010 transitions. Word has length 114 [2023-12-15 21:31:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:47,122 INFO L495 AbstractCegarLoop]: Abstraction has 789 states and 1010 transitions. [2023-12-15 21:31:47,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1010 transitions. [2023-12-15 21:31:47,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 21:31:47,123 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:47,123 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:47,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-15 21:31:47,123 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:47,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1545119956, now seen corresponding path program 1 times [2023-12-15 21:31:47,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:47,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939599950] [2023-12-15 21:31:47,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:47,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:47,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:47,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:47,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:47,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:47,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:47,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:47,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:47,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:47,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:47,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:47,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:47,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:47,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:47,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:47,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:47,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939599950] [2023-12-15 21:31:47,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939599950] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:47,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:47,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:31:47,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938338030] [2023-12-15 21:31:47,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:47,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:31:47,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:47,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:31:47,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:31:47,445 INFO L87 Difference]: Start difference. First operand 789 states and 1010 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:47,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:47,796 INFO L93 Difference]: Finished difference Result 1635 states and 2086 transitions. [2023-12-15 21:31:47,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:31:47,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2023-12-15 21:31:47,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:47,798 INFO L225 Difference]: With dead ends: 1635 [2023-12-15 21:31:47,798 INFO L226 Difference]: Without dead ends: 887 [2023-12-15 21:31:47,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:31:47,800 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 186 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:47,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 731 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:31:47,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2023-12-15 21:31:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 805. [2023-12-15 21:31:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 669 states have (on average 1.218236173393124) internal successors, (815), 675 states have internal predecessors, (815), 106 states have call successors, (106), 29 states have call predecessors, (106), 29 states have return successors, (106), 100 states have call predecessors, (106), 106 states have call successors, (106) [2023-12-15 21:31:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1027 transitions. [2023-12-15 21:31:47,897 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1027 transitions. Word has length 114 [2023-12-15 21:31:47,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:47,897 INFO L495 AbstractCegarLoop]: Abstraction has 805 states and 1027 transitions. [2023-12-15 21:31:47,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:47,897 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1027 transitions. [2023-12-15 21:31:47,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 21:31:47,898 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:47,898 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:47,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-15 21:31:47,898 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:47,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:47,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1152092946, now seen corresponding path program 1 times [2023-12-15 21:31:47,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:47,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760052886] [2023-12-15 21:31:47,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:47,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:48,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:48,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760052886] [2023-12-15 21:31:48,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760052886] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:48,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:48,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:31:48,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954628757] [2023-12-15 21:31:48,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:48,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:31:48,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:48,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:31:48,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:48,052 INFO L87 Difference]: Start difference. First operand 805 states and 1027 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:48,242 INFO L93 Difference]: Finished difference Result 1897 states and 2410 transitions. [2023-12-15 21:31:48,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:31:48,243 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2023-12-15 21:31:48,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:48,246 INFO L225 Difference]: With dead ends: 1897 [2023-12-15 21:31:48,246 INFO L226 Difference]: Without dead ends: 1133 [2023-12-15 21:31:48,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:48,247 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 54 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:48,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 604 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2023-12-15 21:31:48,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 951. [2023-12-15 21:31:48,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 815 states have (on average 1.2417177914110429) internal successors, (1012), 821 states have internal predecessors, (1012), 106 states have call successors, (106), 29 states have call predecessors, (106), 29 states have return successors, (106), 100 states have call predecessors, (106), 106 states have call successors, (106) [2023-12-15 21:31:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1224 transitions. [2023-12-15 21:31:48,360 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1224 transitions. Word has length 114 [2023-12-15 21:31:48,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:48,360 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1224 transitions. [2023-12-15 21:31:48,360 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:31:48,360 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1224 transitions. [2023-12-15 21:31:48,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 21:31:48,361 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:48,361 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:48,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-15 21:31:48,361 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:48,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:48,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1763974674, now seen corresponding path program 1 times [2023-12-15 21:31:48,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:48,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590794520] [2023-12-15 21:31:48,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:48,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:48,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:48,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590794520] [2023-12-15 21:31:48,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590794520] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:48,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:48,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:31:48,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055298540] [2023-12-15 21:31:48,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:48,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:31:48,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:48,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:31:48,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:31:48,827 INFO L87 Difference]: Start difference. First operand 951 states and 1224 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:49,193 INFO L93 Difference]: Finished difference Result 1902 states and 2459 transitions. [2023-12-15 21:31:49,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:31:49,194 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2023-12-15 21:31:49,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:49,196 INFO L225 Difference]: With dead ends: 1902 [2023-12-15 21:31:49,196 INFO L226 Difference]: Without dead ends: 992 [2023-12-15 21:31:49,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:31:49,197 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 91 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:49,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 505 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:31:49,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2023-12-15 21:31:49,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2023-12-15 21:31:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 856 states have (on average 1.2476635514018692) internal successors, (1068), 861 states have internal predecessors, (1068), 106 states have call successors, (106), 29 states have call predecessors, (106), 29 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2023-12-15 21:31:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1280 transitions. [2023-12-15 21:31:49,297 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1280 transitions. Word has length 114 [2023-12-15 21:31:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:49,297 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1280 transitions. [2023-12-15 21:31:49,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:49,297 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1280 transitions. [2023-12-15 21:31:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 21:31:49,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:49,298 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:49,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-15 21:31:49,298 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:49,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:49,299 INFO L85 PathProgramCache]: Analyzing trace with hash 812691466, now seen corresponding path program 1 times [2023-12-15 21:31:49,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:49,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420913670] [2023-12-15 21:31:49,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:49,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:49,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:49,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:49,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:49,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:49,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:49,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:49,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:49,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:49,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:49,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:49,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:49,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:49,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:49,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:49,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:49,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420913670] [2023-12-15 21:31:49,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420913670] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:49,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:49,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:31:49,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773852782] [2023-12-15 21:31:49,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:49,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:31:49,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:49,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:31:49,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:49,760 INFO L87 Difference]: Start difference. First operand 992 states and 1280 transitions. Second operand has 7 states, 5 states have (on average 9.4) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 21:31:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:50,113 INFO L93 Difference]: Finished difference Result 1777 states and 2287 transitions. [2023-12-15 21:31:50,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:31:50,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.4) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2023-12-15 21:31:50,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:50,116 INFO L225 Difference]: With dead ends: 1777 [2023-12-15 21:31:50,116 INFO L226 Difference]: Without dead ends: 1083 [2023-12-15 21:31:50,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:31:50,118 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 89 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:50,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 462 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:31:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2023-12-15 21:31:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 925. [2023-12-15 21:31:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 792 states have (on average 1.220959595959596) internal successors, (967), 797 states have internal predecessors, (967), 102 states have call successors, (102), 30 states have call predecessors, (102), 30 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2023-12-15 21:31:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1171 transitions. [2023-12-15 21:31:50,231 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1171 transitions. Word has length 114 [2023-12-15 21:31:50,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:50,231 INFO L495 AbstractCegarLoop]: Abstraction has 925 states and 1171 transitions. [2023-12-15 21:31:50,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.4) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 21:31:50,231 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1171 transitions. [2023-12-15 21:31:50,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 21:31:50,232 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:50,232 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:50,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-15 21:31:50,232 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:50,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:50,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2052729928, now seen corresponding path program 1 times [2023-12-15 21:31:50,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:50,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578249108] [2023-12-15 21:31:50,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:50,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:50,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:50,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:50,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:50,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:50,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:50,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:50,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:50,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:50,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:50,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:50,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:50,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:50,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:50,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:50,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:50,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578249108] [2023-12-15 21:31:50,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578249108] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:50,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:50,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:31:50,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901859503] [2023-12-15 21:31:50,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:50,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:31:50,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:50,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:31:50,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:50,467 INFO L87 Difference]: Start difference. First operand 925 states and 1171 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:50,801 INFO L93 Difference]: Finished difference Result 1484 states and 1883 transitions. [2023-12-15 21:31:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:31:50,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2023-12-15 21:31:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:50,804 INFO L225 Difference]: With dead ends: 1484 [2023-12-15 21:31:50,804 INFO L226 Difference]: Without dead ends: 913 [2023-12-15 21:31:50,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:50,805 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 66 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:50,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 407 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:31:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2023-12-15 21:31:50,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 692. [2023-12-15 21:31:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 602 states have (on average 1.2142857142857142) internal successors, (731), 604 states have internal predecessors, (731), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:31:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 867 transitions. [2023-12-15 21:31:50,889 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 867 transitions. Word has length 115 [2023-12-15 21:31:50,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:50,890 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 867 transitions. [2023-12-15 21:31:50,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 867 transitions. [2023-12-15 21:31:50,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-15 21:31:50,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:50,890 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:50,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-15 21:31:50,891 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:50,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:50,891 INFO L85 PathProgramCache]: Analyzing trace with hash -291367159, now seen corresponding path program 1 times [2023-12-15 21:31:50,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:50,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725199464] [2023-12-15 21:31:50,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:50,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:52,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:52,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:52,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:52,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:52,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:52,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:52,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:52,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:52,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:52,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:52,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:52,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:52,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:52,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:52,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:52,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725199464] [2023-12-15 21:31:52,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725199464] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:52,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:52,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-15 21:31:52,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951952210] [2023-12-15 21:31:52,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:52,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-15 21:31:52,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:52,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-15 21:31:52,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:31:52,383 INFO L87 Difference]: Start difference. First operand 692 states and 867 transitions. Second operand has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 21:31:53,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:53,948 INFO L93 Difference]: Finished difference Result 1686 states and 2106 transitions. [2023-12-15 21:31:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-15 21:31:53,949 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2023-12-15 21:31:53,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:53,952 INFO L225 Difference]: With dead ends: 1686 [2023-12-15 21:31:53,952 INFO L226 Difference]: Without dead ends: 1269 [2023-12-15 21:31:53,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=264, Invalid=1218, Unknown=0, NotChecked=0, Total=1482 [2023-12-15 21:31:53,953 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 470 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:53,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1557 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 21:31:53,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2023-12-15 21:31:54,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1009. [2023-12-15 21:31:54,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 901 states have (on average 1.2197558268590456) internal successors, (1099), 906 states have internal predecessors, (1099), 80 states have call successors, (80), 27 states have call predecessors, (80), 27 states have return successors, (80), 75 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-15 21:31:54,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1259 transitions. [2023-12-15 21:31:54,076 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1259 transitions. Word has length 116 [2023-12-15 21:31:54,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:54,076 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1259 transitions. [2023-12-15 21:31:54,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 21:31:54,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1259 transitions. [2023-12-15 21:31:54,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 21:31:54,077 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:54,078 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:54,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-15 21:31:54,078 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:54,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:54,078 INFO L85 PathProgramCache]: Analyzing trace with hash -576545312, now seen corresponding path program 1 times [2023-12-15 21:31:54,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:54,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617188006] [2023-12-15 21:31:54,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:54,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:54,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:54,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:54,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:54,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:54,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:54,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:54,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:54,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:54,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:54,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:54,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:54,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:54,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:54,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:54,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:54,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617188006] [2023-12-15 21:31:54,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617188006] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:54,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:54,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:31:54,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706598676] [2023-12-15 21:31:54,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:54,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:31:54,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:54,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:31:54,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:31:54,496 INFO L87 Difference]: Start difference. First operand 1009 states and 1259 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:55,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:55,014 INFO L93 Difference]: Finished difference Result 2039 states and 2540 transitions. [2023-12-15 21:31:55,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:31:55,015 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2023-12-15 21:31:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:55,018 INFO L225 Difference]: With dead ends: 2039 [2023-12-15 21:31:55,018 INFO L226 Difference]: Without dead ends: 1445 [2023-12-15 21:31:55,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:31:55,019 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 122 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:55,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 993 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:31:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2023-12-15 21:31:55,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1149. [2023-12-15 21:31:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1041 states have (on average 1.2209414024975984) internal successors, (1271), 1046 states have internal predecessors, (1271), 80 states have call successors, (80), 27 states have call predecessors, (80), 27 states have return successors, (80), 75 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-15 21:31:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1431 transitions. [2023-12-15 21:31:55,149 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1431 transitions. Word has length 117 [2023-12-15 21:31:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:55,149 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1431 transitions. [2023-12-15 21:31:55,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:55,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1431 transitions. [2023-12-15 21:31:55,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 21:31:55,150 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:55,150 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:55,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-15 21:31:55,150 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:55,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:55,150 INFO L85 PathProgramCache]: Analyzing trace with hash -268507744, now seen corresponding path program 1 times [2023-12-15 21:31:55,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:55,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367180843] [2023-12-15 21:31:55,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:55,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:55,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:55,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:55,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:55,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:55,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:55,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:55,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:55,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:55,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:55,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:55,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:55,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:55,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:55,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:55,374 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:55,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:55,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367180843] [2023-12-15 21:31:55,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367180843] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:55,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:55,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:31:55,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993494255] [2023-12-15 21:31:55,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:55,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:31:55,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:55,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:31:55,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:55,375 INFO L87 Difference]: Start difference. First operand 1149 states and 1431 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:55,610 INFO L93 Difference]: Finished difference Result 2123 states and 2628 transitions. [2023-12-15 21:31:55,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:31:55,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2023-12-15 21:31:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:55,614 INFO L225 Difference]: With dead ends: 2123 [2023-12-15 21:31:55,614 INFO L226 Difference]: Without dead ends: 1429 [2023-12-15 21:31:55,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:31:55,615 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 64 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:55,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 754 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2023-12-15 21:31:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1267. [2023-12-15 21:31:55,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 1159 states have (on average 1.2122519413287316) internal successors, (1405), 1164 states have internal predecessors, (1405), 80 states have call successors, (80), 27 states have call predecessors, (80), 27 states have return successors, (80), 75 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-15 21:31:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1565 transitions. [2023-12-15 21:31:55,743 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1565 transitions. Word has length 117 [2023-12-15 21:31:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:55,743 INFO L495 AbstractCegarLoop]: Abstraction has 1267 states and 1565 transitions. [2023-12-15 21:31:55,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:31:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1565 transitions. [2023-12-15 21:31:55,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-15 21:31:55,744 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:55,744 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:55,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-12-15 21:31:55,744 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:55,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:55,745 INFO L85 PathProgramCache]: Analyzing trace with hash -7599633, now seen corresponding path program 1 times [2023-12-15 21:31:55,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:55,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940982664] [2023-12-15 21:31:55,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:55,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:56,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:56,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:56,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:56,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:56,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:56,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:56,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:56,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:56,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:56,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:56,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:56,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:56,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:56,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:56,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:56,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940982664] [2023-12-15 21:31:56,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940982664] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:56,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:56,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:31:56,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030099123] [2023-12-15 21:31:56,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:56,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:31:56,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:56,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:31:56,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:31:56,501 INFO L87 Difference]: Start difference. First operand 1267 states and 1565 transitions. Second operand has 10 states, 7 states have (on average 7.285714285714286) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-15 21:31:57,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:57,140 INFO L93 Difference]: Finished difference Result 2772 states and 3422 transitions. [2023-12-15 21:31:57,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:31:57,141 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 7.285714285714286) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 118 [2023-12-15 21:31:57,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:57,145 INFO L225 Difference]: With dead ends: 2772 [2023-12-15 21:31:57,145 INFO L226 Difference]: Without dead ends: 1963 [2023-12-15 21:31:57,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:31:57,146 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 188 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:57,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 938 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:31:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2023-12-15 21:31:57,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1434. [2023-12-15 21:31:57,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1326 states have (on average 1.2187028657616892) internal successors, (1616), 1331 states have internal predecessors, (1616), 80 states have call successors, (80), 27 states have call predecessors, (80), 27 states have return successors, (80), 75 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-15 21:31:57,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1776 transitions. [2023-12-15 21:31:57,284 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1776 transitions. Word has length 118 [2023-12-15 21:31:57,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:57,284 INFO L495 AbstractCegarLoop]: Abstraction has 1434 states and 1776 transitions. [2023-12-15 21:31:57,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 7.285714285714286) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-15 21:31:57,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1776 transitions. [2023-12-15 21:31:57,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-15 21:31:57,285 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:57,285 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:57,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-12-15 21:31:57,285 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:57,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:57,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1028667987, now seen corresponding path program 1 times [2023-12-15 21:31:57,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:57,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635332967] [2023-12-15 21:31:57,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:57,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:57,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:57,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:57,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:57,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:57,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:57,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:57,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:57,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:57,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:57,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:57,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:57,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:57,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:57,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:57,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635332967] [2023-12-15 21:31:57,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635332967] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:57,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:57,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:31:57,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073810395] [2023-12-15 21:31:57,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:57,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:31:57,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:57,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:31:57,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:31:57,857 INFO L87 Difference]: Start difference. First operand 1434 states and 1776 transitions. Second operand has 8 states, 5 states have (on average 10.2) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-15 21:31:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:58,185 INFO L93 Difference]: Finished difference Result 3230 states and 3977 transitions. [2023-12-15 21:31:58,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:31:58,185 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 10.2) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 118 [2023-12-15 21:31:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:58,196 INFO L225 Difference]: With dead ends: 3230 [2023-12-15 21:31:58,196 INFO L226 Difference]: Without dead ends: 2347 [2023-12-15 21:31:58,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:31:58,204 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 121 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:58,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 672 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:31:58,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2347 states. [2023-12-15 21:31:58,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 1476. [2023-12-15 21:31:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1368 states have (on average 1.226608187134503) internal successors, (1678), 1373 states have internal predecessors, (1678), 80 states have call successors, (80), 27 states have call predecessors, (80), 27 states have return successors, (80), 75 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-15 21:31:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 1838 transitions. [2023-12-15 21:31:58,361 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 1838 transitions. Word has length 118 [2023-12-15 21:31:58,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:58,363 INFO L495 AbstractCegarLoop]: Abstraction has 1476 states and 1838 transitions. [2023-12-15 21:31:58,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 10.2) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-15 21:31:58,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1838 transitions. [2023-12-15 21:31:58,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-15 21:31:58,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:58,364 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:58,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-12-15 21:31:58,364 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:58,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:58,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2039785237, now seen corresponding path program 1 times [2023-12-15 21:31:58,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:58,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948892786] [2023-12-15 21:31:58,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:58,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:59,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:59,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:59,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:59,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:59,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:59,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:59,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:59,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:59,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:59,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:59,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:59,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:31:59,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:59,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948892786] [2023-12-15 21:31:59,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948892786] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:59,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:59,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-15 21:31:59,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562055767] [2023-12-15 21:31:59,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:59,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 21:31:59,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:59,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 21:31:59,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:31:59,113 INFO L87 Difference]: Start difference. First operand 1476 states and 1838 transitions. Second operand has 13 states, 10 states have (on average 5.1) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-15 21:32:00,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:00,180 INFO L93 Difference]: Finished difference Result 2977 states and 3712 transitions. [2023-12-15 21:32:00,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-15 21:32:00,180 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 5.1) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 118 [2023-12-15 21:32:00,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:00,184 INFO L225 Difference]: With dead ends: 2977 [2023-12-15 21:32:00,184 INFO L226 Difference]: Without dead ends: 2055 [2023-12-15 21:32:00,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2023-12-15 21:32:00,185 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 283 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:00,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1111 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-15 21:32:00,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2023-12-15 21:32:00,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1477. [2023-12-15 21:32:00,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1368 states have (on average 1.2288011695906433) internal successors, (1681), 1373 states have internal predecessors, (1681), 80 states have call successors, (80), 28 states have call predecessors, (80), 28 states have return successors, (80), 75 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-15 21:32:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1841 transitions. [2023-12-15 21:32:00,322 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 1841 transitions. Word has length 118 [2023-12-15 21:32:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:00,322 INFO L495 AbstractCegarLoop]: Abstraction has 1477 states and 1841 transitions. [2023-12-15 21:32:00,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 5.1) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-15 21:32:00,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1841 transitions. [2023-12-15 21:32:00,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-15 21:32:00,323 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:00,323 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:32:00,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-12-15 21:32:00,324 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:00,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:00,324 INFO L85 PathProgramCache]: Analyzing trace with hash 81455407, now seen corresponding path program 1 times [2023-12-15 21:32:00,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:00,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379635245] [2023-12-15 21:32:00,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:00,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-15 21:32:00,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-12-15 21:32:00,707 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Termination requested (timeout or resource limit) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:152) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:869) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:793) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-15 21:32:00,710 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:32:00,720 INFO L158 Benchmark]: Toolchain (without parser) took 51902.08ms. Allocated memory was 241.2MB in the beginning and 1.2GB in the end (delta: 921.7MB). Free memory was 172.8MB in the beginning and 1.1GB in the end (delta: -932.0MB). Peak memory consumption was 672.4MB. Max. memory is 8.0GB. [2023-12-15 21:32:00,720 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 241.2MB. Free memory is still 188.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:32:00,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.96ms. Allocated memory was 241.2MB in the beginning and 343.9MB in the end (delta: 102.8MB). Free memory was 172.6MB in the beginning and 305.8MB in the end (delta: -133.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-15 21:32:00,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.16ms. Allocated memory is still 343.9MB. Free memory was 305.7MB in the beginning and 301.0MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:32:00,720 INFO L158 Benchmark]: Boogie Preprocessor took 83.94ms. Allocated memory is still 343.9MB. Free memory was 301.0MB in the beginning and 305.7MB in the end (delta: -4.7MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2023-12-15 21:32:00,721 INFO L158 Benchmark]: RCFGBuilder took 588.17ms. Allocated memory is still 343.9MB. Free memory was 305.7MB in the beginning and 273.2MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2023-12-15 21:32:00,721 INFO L158 Benchmark]: TraceAbstraction took 50832.30ms. Allocated memory was 343.9MB in the beginning and 1.2GB in the end (delta: 818.9MB). Free memory was 272.1MB in the beginning and 1.1GB in the end (delta: -832.7MB). Peak memory consumption was 668.3MB. Max. memory is 8.0GB. [2023-12-15 21:32:00,721 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 241.2MB. Free memory is still 188.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 324.96ms. Allocated memory was 241.2MB in the beginning and 343.9MB in the end (delta: 102.8MB). Free memory was 172.6MB in the beginning and 305.8MB in the end (delta: -133.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.16ms. Allocated memory is still 343.9MB. Free memory was 305.7MB in the beginning and 301.0MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 83.94ms. Allocated memory is still 343.9MB. Free memory was 301.0MB in the beginning and 305.7MB in the end (delta: -4.7MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * RCFGBuilder took 588.17ms. Allocated memory is still 343.9MB. Free memory was 305.7MB in the beginning and 273.2MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 50832.30ms. Allocated memory was 343.9MB in the beginning and 1.2GB in the end (delta: 818.9MB). Free memory was 272.1MB in the beginning and 1.1GB in the end (delta: -832.7MB). Peak memory consumption was 668.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Termination requested (timeout or resource limit) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Termination requested (timeout or resource limit): de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown