/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/eca-rers2012/Problem17_label15.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 19:08:49,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 19:08:49,472 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 19:08:49,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 19:08:49,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 19:08:49,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 19:08:49,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 19:08:49,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 19:08:49,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 19:08:49,511 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 19:08:49,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 19:08:49,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 19:08:49,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 19:08:49,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 19:08:49,513 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 19:08:49,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 19:08:49,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 19:08:49,514 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 19:08:49,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 19:08:49,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 19:08:49,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 19:08:49,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 19:08:49,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 19:08:49,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 19:08:49,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 19:08:49,517 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 19:08:49,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 19:08:49,517 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 19:08:49,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 19:08:49,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 19:08:49,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 19:08:49,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 19:08:49,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 19:08:49,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 19:08:49,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 19:08:49,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 19:08:49,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 19:08:49,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 19:08:49,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 19:08:49,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 19:08:49,520 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 19:08:49,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 19:08:49,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 19:08:49,521 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 19:08:49,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 19:08:49,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 19:08:49,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 19:08:49,774 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 19:08:49,776 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 19:08:49,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label15.c [2023-12-15 19:08:50,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 19:08:51,376 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 19:08:51,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label15.c [2023-12-15 19:08:51,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2f25cee/f8b90c47cb4d4b129102936f93cef28e/FLAG7976b1efd [2023-12-15 19:08:51,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2f25cee/f8b90c47cb4d4b129102936f93cef28e [2023-12-15 19:08:51,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 19:08:51,421 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 19:08:51,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 19:08:51,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 19:08:51,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 19:08:51,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 07:08:51" (1/1) ... [2023-12-15 19:08:51,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@511a7923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:08:51, skipping insertion in model container [2023-12-15 19:08:51,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 07:08:51" (1/1) ... [2023-12-15 19:08:51,516 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 19:08:51,709 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label15.c[5490,5503] [2023-12-15 19:08:52,226 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 19:08:52,236 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 19:08:52,262 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label15.c[5490,5503] [2023-12-15 19:08:52,510 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 19:08:52,527 INFO L206 MainTranslator]: Completed translation [2023-12-15 19:08:52,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:08:52 WrapperNode [2023-12-15 19:08:52,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 19:08:52,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 19:08:52,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 19:08:52,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 19:08:52,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:08:52" (1/1) ... [2023-12-15 19:08:52,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:08:52" (1/1) ... [2023-12-15 19:08:52,862 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2023-12-15 19:08:52,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 19:08:52,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 19:08:52,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 19:08:52,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 19:08:52,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:08:52" (1/1) ... [2023-12-15 19:08:52,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:08:52" (1/1) ... [2023-12-15 19:08:52,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:08:52" (1/1) ... [2023-12-15 19:08:53,155 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 19:08:53,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:08:52" (1/1) ... [2023-12-15 19:08:53,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:08:52" (1/1) ... [2023-12-15 19:08:53,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:08:52" (1/1) ... [2023-12-15 19:08:53,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:08:52" (1/1) ... [2023-12-15 19:08:53,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:08:52" (1/1) ... [2023-12-15 19:08:53,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:08:52" (1/1) ... [2023-12-15 19:08:53,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 19:08:53,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 19:08:53,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 19:08:53,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 19:08:53,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:08:52" (1/1) ... [2023-12-15 19:08:53,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 19:08:53,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 19:08:53,433 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 19:08:53,446 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 19:08:53,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 19:08:53,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 19:08:53,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 19:08:53,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 19:08:53,516 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 19:08:53,517 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 19:08:56,613 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 19:08:56,668 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 19:08:56,668 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 19:08:56,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 07:08:56 BoogieIcfgContainer [2023-12-15 19:08:56,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 19:08:56,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 19:08:56,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 19:08:56,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 19:08:56,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 07:08:51" (1/3) ... [2023-12-15 19:08:56,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e37456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 07:08:56, skipping insertion in model container [2023-12-15 19:08:56,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:08:52" (2/3) ... [2023-12-15 19:08:56,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e37456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 07:08:56, skipping insertion in model container [2023-12-15 19:08:56,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 07:08:56" (3/3) ... [2023-12-15 19:08:56,676 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label15.c [2023-12-15 19:08:56,691 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 19:08:56,692 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 19:08:56,757 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 19:08:56,763 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;@3d887e91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 19:08:56,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 19:08:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:08:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-15 19:08:56,778 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:08:56,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 19:08:56,779 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:08:56,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:08:56,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2104242004, now seen corresponding path program 1 times [2023-12-15 19:08:56,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:08:56,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555215346] [2023-12-15 19:08:56,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:08:56,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:08:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:08:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 19:08:56,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:08:56,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555215346] [2023-12-15 19:08:56,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555215346] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:08:56,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:08:56,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 19:08:56,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951246318] [2023-12-15 19:08:56,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:08:56,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 19:08:56,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:08:56,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 19:08:56,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 19:08:56,978 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:08:57,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:08:57,058 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2023-12-15 19:08:57,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 19:08:57,066 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-15 19:08:57,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:08:57,082 INFO L225 Difference]: With dead ends: 1055 [2023-12-15 19:08:57,082 INFO L226 Difference]: Without dead ends: 526 [2023-12-15 19:08:57,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 19:08:57,089 INFO L413 NwaCegarLoop]: 935 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 19:08:57,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 19:08:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2023-12-15 19:08:57,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2023-12-15 19:08:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:08:57,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2023-12-15 19:08:57,154 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 35 [2023-12-15 19:08:57,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:08:57,154 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2023-12-15 19:08:57,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:08:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2023-12-15 19:08:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-15 19:08:57,156 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:08:57,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 19:08:57,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 19:08:57,156 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:08:57,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:08:57,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1200946327, now seen corresponding path program 1 times [2023-12-15 19:08:57,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:08:57,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545263526] [2023-12-15 19:08:57,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:08:57,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:08:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:08:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 19:08:57,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:08:57,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545263526] [2023-12-15 19:08:57,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545263526] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:08:57,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:08:57,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 19:08:57,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289279232] [2023-12-15 19:08:57,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:08:57,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 19:08:57,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:08:57,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 19:08:57,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 19:08:57,339 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:08:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:08:59,911 INFO L93 Difference]: Finished difference Result 1535 states and 2741 transitions. [2023-12-15 19:08:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 19:08:59,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-15 19:08:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:08:59,918 INFO L225 Difference]: With dead ends: 1535 [2023-12-15 19:08:59,918 INFO L226 Difference]: Without dead ends: 1010 [2023-12-15 19:08:59,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 19:08:59,929 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 497 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-15 19:08:59,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 197 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-15 19:08:59,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2023-12-15 19:08:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 995. [2023-12-15 19:08:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 994 states have (on average 1.7364185110663983) internal successors, (1726), 994 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:08:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1726 transitions. [2023-12-15 19:08:59,966 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1726 transitions. Word has length 35 [2023-12-15 19:08:59,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:08:59,966 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1726 transitions. [2023-12-15 19:08:59,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:08:59,967 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1726 transitions. [2023-12-15 19:08:59,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-15 19:08:59,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:08:59,976 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:08:59,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 19:08:59,977 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:08:59,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:08:59,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2063531368, now seen corresponding path program 1 times [2023-12-15 19:08:59,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:08:59,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723701294] [2023-12-15 19:08:59,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:08:59,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:09:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:09:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 19:09:00,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:09:00,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723701294] [2023-12-15 19:09:00,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723701294] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:09:00,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:09:00,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 19:09:00,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612552082] [2023-12-15 19:09:00,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:09:00,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 19:09:00,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:09:00,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 19:09:00,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 19:09:00,194 INFO L87 Difference]: Start difference. First operand 995 states and 1726 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:02,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:09:02,340 INFO L93 Difference]: Finished difference Result 2870 states and 5024 transitions. [2023-12-15 19:09:02,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 19:09:02,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2023-12-15 19:09:02,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:09:02,349 INFO L225 Difference]: With dead ends: 2870 [2023-12-15 19:09:02,350 INFO L226 Difference]: Without dead ends: 1876 [2023-12-15 19:09:02,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 19:09:02,353 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-15 19:09:02,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 518 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-15 19:09:02,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2023-12-15 19:09:02,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1869. [2023-12-15 19:09:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1868 states have (on average 1.4721627408993576) internal successors, (2750), 1868 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2750 transitions. [2023-12-15 19:09:02,394 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2750 transitions. Word has length 100 [2023-12-15 19:09:02,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:09:02,395 INFO L495 AbstractCegarLoop]: Abstraction has 1869 states and 2750 transitions. [2023-12-15 19:09:02,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:02,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2750 transitions. [2023-12-15 19:09:02,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-15 19:09:02,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:09:02,397 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:02,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 19:09:02,397 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:09:02,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:09:02,398 INFO L85 PathProgramCache]: Analyzing trace with hash 357601429, now seen corresponding path program 1 times [2023-12-15 19:09:02,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:09:02,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351551663] [2023-12-15 19:09:02,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:09:02,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:09:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:09:02,702 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 19:09:02,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:09:02,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351551663] [2023-12-15 19:09:02,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351551663] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:09:02,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:09:02,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 19:09:02,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035586610] [2023-12-15 19:09:02,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:09:02,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 19:09:02,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:09:02,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 19:09:02,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 19:09:02,707 INFO L87 Difference]: Start difference. First operand 1869 states and 2750 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:06,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:09:06,232 INFO L93 Difference]: Finished difference Result 6369 states and 9653 transitions. [2023-12-15 19:09:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 19:09:06,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2023-12-15 19:09:06,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:09:06,249 INFO L225 Difference]: With dead ends: 6369 [2023-12-15 19:09:06,249 INFO L226 Difference]: Without dead ends: 4501 [2023-12-15 19:09:06,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 19:09:06,253 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 1083 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 892 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 3475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 892 IncrementalHoareTripleChecker+Valid, 2583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-15 19:09:06,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 190 Invalid, 3475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [892 Valid, 2583 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-15 19:09:06,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4501 states. [2023-12-15 19:09:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4501 to 4496. [2023-12-15 19:09:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4496 states, 4495 states have (on average 1.4271412680756397) internal successors, (6415), 4495 states have internal predecessors, (6415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4496 states to 4496 states and 6415 transitions. [2023-12-15 19:09:06,330 INFO L78 Accepts]: Start accepts. Automaton has 4496 states and 6415 transitions. Word has length 105 [2023-12-15 19:09:06,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:09:06,330 INFO L495 AbstractCegarLoop]: Abstraction has 4496 states and 6415 transitions. [2023-12-15 19:09:06,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4496 states and 6415 transitions. [2023-12-15 19:09:06,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-15 19:09:06,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:09:06,334 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:06,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 19:09:06,334 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:09:06,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:09:06,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1383530739, now seen corresponding path program 1 times [2023-12-15 19:09:06,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:09:06,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099772547] [2023-12-15 19:09:06,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:09:06,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:09:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:09:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 19:09:06,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:09:06,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099772547] [2023-12-15 19:09:06,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099772547] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:09:06,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:09:06,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 19:09:06,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067162821] [2023-12-15 19:09:06,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:09:06,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 19:09:06,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:09:06,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 19:09:06,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 19:09:06,550 INFO L87 Difference]: Start difference. First operand 4496 states and 6415 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:08,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:09:08,463 INFO L93 Difference]: Finished difference Result 11973 states and 17430 transitions. [2023-12-15 19:09:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 19:09:08,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2023-12-15 19:09:08,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:09:08,487 INFO L225 Difference]: With dead ends: 11973 [2023-12-15 19:09:08,487 INFO L226 Difference]: Without dead ends: 7478 [2023-12-15 19:09:08,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 19:09:08,496 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 364 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-15 19:09:08,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 495 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-15 19:09:08,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7478 states. [2023-12-15 19:09:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7478 to 7045. [2023-12-15 19:09:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7045 states, 7044 states have (on average 1.3350369108461102) internal successors, (9404), 7044 states have internal predecessors, (9404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7045 states to 7045 states and 9404 transitions. [2023-12-15 19:09:08,614 INFO L78 Accepts]: Start accepts. Automaton has 7045 states and 9404 transitions. Word has length 141 [2023-12-15 19:09:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:09:08,614 INFO L495 AbstractCegarLoop]: Abstraction has 7045 states and 9404 transitions. [2023-12-15 19:09:08,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 7045 states and 9404 transitions. [2023-12-15 19:09:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-15 19:09:08,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:09:08,617 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 19:09:08,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 19:09:08,617 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:09:08,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:09:08,618 INFO L85 PathProgramCache]: Analyzing trace with hash -622822676, now seen corresponding path program 1 times [2023-12-15 19:09:08,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:09:08,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399793714] [2023-12-15 19:09:08,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:09:08,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:09:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:09:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 67 proven. 63 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 19:09:08,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:09:08,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399793714] [2023-12-15 19:09:08,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399793714] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 19:09:08,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311585182] [2023-12-15 19:09:08,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:09:08,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 19:09:08,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 19:09:08,963 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 19:09:08,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 19:09:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:09:09,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 19:09:09,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 19:09:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-15 19:09:09,185 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 19:09:09,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311585182] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:09:09,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 19:09:09,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-12-15 19:09:09,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696256874] [2023-12-15 19:09:09,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:09:09,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 19:09:09,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:09:09,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 19:09:09,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 19:09:09,188 INFO L87 Difference]: Start difference. First operand 7045 states and 9404 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:11,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:09:11,151 INFO L93 Difference]: Finished difference Result 18765 states and 25513 transitions. [2023-12-15 19:09:11,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 19:09:11,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2023-12-15 19:09:11,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:09:11,192 INFO L225 Difference]: With dead ends: 18765 [2023-12-15 19:09:11,192 INFO L226 Difference]: Without dead ends: 12146 [2023-12-15 19:09:11,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 19:09:11,205 INFO L413 NwaCegarLoop]: 687 mSDtfsCounter, 571 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-15 19:09:11,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 715 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-15 19:09:11,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12146 states. [2023-12-15 19:09:11,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12146 to 11295. [2023-12-15 19:09:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11295 states, 11294 states have (on average 1.3668319461661058) internal successors, (15437), 11294 states have internal predecessors, (15437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11295 states to 11295 states and 15437 transitions. [2023-12-15 19:09:11,401 INFO L78 Accepts]: Start accepts. Automaton has 11295 states and 15437 transitions. Word has length 170 [2023-12-15 19:09:11,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:09:11,401 INFO L495 AbstractCegarLoop]: Abstraction has 11295 states and 15437 transitions. [2023-12-15 19:09:11,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 11295 states and 15437 transitions. [2023-12-15 19:09:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-15 19:09:11,404 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:09:11,404 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 19:09:11,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 19:09:11,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-15 19:09:11,609 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:09:11,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:09:11,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2068436520, now seen corresponding path program 1 times [2023-12-15 19:09:11,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:09:11,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664958269] [2023-12-15 19:09:11,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:09:11,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:09:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:09:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-15 19:09:11,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:09:11,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664958269] [2023-12-15 19:09:11,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664958269] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:09:11,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:09:11,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 19:09:11,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846670392] [2023-12-15 19:09:11,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:09:11,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 19:09:11,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:09:11,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 19:09:11,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 19:09:11,778 INFO L87 Difference]: Start difference. First operand 11295 states and 15437 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:09:13,619 INFO L93 Difference]: Finished difference Result 23014 states and 31466 transitions. [2023-12-15 19:09:13,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 19:09:13,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2023-12-15 19:09:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:09:13,639 INFO L225 Difference]: With dead ends: 23014 [2023-12-15 19:09:13,639 INFO L226 Difference]: Without dead ends: 11291 [2023-12-15 19:09:13,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 19:09:13,652 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 381 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-15 19:09:13,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 581 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-15 19:09:13,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11291 states. [2023-12-15 19:09:13,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11291 to 8314. [2023-12-15 19:09:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8314 states, 8313 states have (on average 1.2512931552989295) internal successors, (10402), 8313 states have internal predecessors, (10402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8314 states to 8314 states and 10402 transitions. [2023-12-15 19:09:13,804 INFO L78 Accepts]: Start accepts. Automaton has 8314 states and 10402 transitions. Word has length 178 [2023-12-15 19:09:13,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:09:13,804 INFO L495 AbstractCegarLoop]: Abstraction has 8314 states and 10402 transitions. [2023-12-15 19:09:13,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 8314 states and 10402 transitions. [2023-12-15 19:09:13,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2023-12-15 19:09:13,806 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:09:13,806 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 19:09:13,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 19:09:13,812 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:09:13,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:09:13,813 INFO L85 PathProgramCache]: Analyzing trace with hash 688634754, now seen corresponding path program 1 times [2023-12-15 19:09:13,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:09:13,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490982926] [2023-12-15 19:09:13,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:09:13,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:09:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:09:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 19:09:14,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:09:14,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490982926] [2023-12-15 19:09:14,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490982926] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:09:14,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:09:14,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 19:09:14,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019747747] [2023-12-15 19:09:14,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:09:14,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 19:09:14,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:09:14,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 19:09:14,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 19:09:14,026 INFO L87 Difference]: Start difference. First operand 8314 states and 10402 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:15,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:09:15,792 INFO L93 Difference]: Finished difference Result 21300 states and 27163 transitions. [2023-12-15 19:09:15,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 19:09:15,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2023-12-15 19:09:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:09:15,833 INFO L225 Difference]: With dead ends: 21300 [2023-12-15 19:09:15,833 INFO L226 Difference]: Without dead ends: 12987 [2023-12-15 19:09:15,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 19:09:15,847 INFO L413 NwaCegarLoop]: 744 mSDtfsCounter, 491 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-15 19:09:15,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 799 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-15 19:09:15,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12987 states. [2023-12-15 19:09:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12987 to 12987. [2023-12-15 19:09:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12987 states, 12986 states have (on average 1.2240104728168797) internal successors, (15895), 12986 states have internal predecessors, (15895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12987 states to 12987 states and 15895 transitions. [2023-12-15 19:09:16,036 INFO L78 Accepts]: Start accepts. Automaton has 12987 states and 15895 transitions. Word has length 191 [2023-12-15 19:09:16,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:09:16,036 INFO L495 AbstractCegarLoop]: Abstraction has 12987 states and 15895 transitions. [2023-12-15 19:09:16,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:16,036 INFO L276 IsEmpty]: Start isEmpty. Operand 12987 states and 15895 transitions. [2023-12-15 19:09:16,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2023-12-15 19:09:16,040 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:09:16,040 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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 19:09:16,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 19:09:16,040 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:09:16,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:09:16,041 INFO L85 PathProgramCache]: Analyzing trace with hash -680829012, now seen corresponding path program 1 times [2023-12-15 19:09:16,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:09:16,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992011658] [2023-12-15 19:09:16,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:09:16,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:09:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:09:16,262 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2023-12-15 19:09:16,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:09:16,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992011658] [2023-12-15 19:09:16,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992011658] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:09:16,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:09:16,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 19:09:16,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241181873] [2023-12-15 19:09:16,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:09:16,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 19:09:16,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:09:16,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 19:09:16,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 19:09:16,264 INFO L87 Difference]: Start difference. First operand 12987 states and 15895 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:09:18,393 INFO L93 Difference]: Finished difference Result 31486 states and 38491 transitions. [2023-12-15 19:09:18,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 19:09:18,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 288 [2023-12-15 19:09:18,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:09:18,425 INFO L225 Difference]: With dead ends: 31486 [2023-12-15 19:09:18,425 INFO L226 Difference]: Without dead ends: 17650 [2023-12-15 19:09:18,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 19:09:18,442 INFO L413 NwaCegarLoop]: 875 mSDtfsCounter, 408 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-15 19:09:18,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 943 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-15 19:09:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17650 states. [2023-12-15 19:09:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17650 to 12113. [2023-12-15 19:09:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12113 states, 12112 states have (on average 1.1775924702774108) internal successors, (14263), 12112 states have internal predecessors, (14263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12113 states to 12113 states and 14263 transitions. [2023-12-15 19:09:18,608 INFO L78 Accepts]: Start accepts. Automaton has 12113 states and 14263 transitions. Word has length 288 [2023-12-15 19:09:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:09:18,609 INFO L495 AbstractCegarLoop]: Abstraction has 12113 states and 14263 transitions. [2023-12-15 19:09:18,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 12113 states and 14263 transitions. [2023-12-15 19:09:18,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2023-12-15 19:09:18,613 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:09:18,613 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 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 19:09:18,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 19:09:18,614 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:09:18,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:09:18,614 INFO L85 PathProgramCache]: Analyzing trace with hash 291287026, now seen corresponding path program 1 times [2023-12-15 19:09:18,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:09:18,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673871150] [2023-12-15 19:09:18,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:09:18,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:09:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:09:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2023-12-15 19:09:18,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:09:18,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673871150] [2023-12-15 19:09:18,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673871150] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:09:18,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:09:18,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 19:09:18,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783765501] [2023-12-15 19:09:18,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:09:18,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 19:09:18,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:09:18,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 19:09:18,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 19:09:18,813 INFO L87 Difference]: Start difference. First operand 12113 states and 14263 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:20,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:09:20,733 INFO L93 Difference]: Finished difference Result 31030 states and 36607 transitions. [2023-12-15 19:09:20,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 19:09:20,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 305 [2023-12-15 19:09:20,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:09:20,770 INFO L225 Difference]: With dead ends: 31030 [2023-12-15 19:09:20,770 INFO L226 Difference]: Without dead ends: 18918 [2023-12-15 19:09:20,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 19:09:20,788 INFO L413 NwaCegarLoop]: 343 mSDtfsCounter, 455 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-15 19:09:20,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 399 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-15 19:09:20,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18918 states. [2023-12-15 19:09:21,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18918 to 16785. [2023-12-15 19:09:21,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16785 states, 16784 states have (on average 1.1661105815061963) internal successors, (19572), 16784 states have internal predecessors, (19572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16785 states to 16785 states and 19572 transitions. [2023-12-15 19:09:21,056 INFO L78 Accepts]: Start accepts. Automaton has 16785 states and 19572 transitions. Word has length 305 [2023-12-15 19:09:21,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:09:21,057 INFO L495 AbstractCegarLoop]: Abstraction has 16785 states and 19572 transitions. [2023-12-15 19:09:21,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 16785 states and 19572 transitions. [2023-12-15 19:09:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2023-12-15 19:09:21,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:09:21,065 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:21,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 19:09:21,065 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:09:21,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:09:21,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2069520865, now seen corresponding path program 1 times [2023-12-15 19:09:21,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:09:21,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998110791] [2023-12-15 19:09:21,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:09:21,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:09:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:09:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-15 19:09:21,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:09:21,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998110791] [2023-12-15 19:09:21,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998110791] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:09:21,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:09:21,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 19:09:21,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129557562] [2023-12-15 19:09:21,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:09:21,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 19:09:21,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:09:21,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 19:09:21,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 19:09:21,395 INFO L87 Difference]: Start difference. First operand 16785 states and 19572 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:23,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:09:23,199 INFO L93 Difference]: Finished difference Result 40430 states and 47470 transitions. [2023-12-15 19:09:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 19:09:23,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2023-12-15 19:09:23,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:09:23,236 INFO L225 Difference]: With dead ends: 40430 [2023-12-15 19:09:23,237 INFO L226 Difference]: Without dead ends: 22796 [2023-12-15 19:09:23,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 19:09:23,253 INFO L413 NwaCegarLoop]: 839 mSDtfsCounter, 381 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-15 19:09:23,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 913 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-15 19:09:23,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22796 states. [2023-12-15 19:09:23,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22796 to 22361. [2023-12-15 19:09:23,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22361 states, 22360 states have (on average 1.1453488372093024) internal successors, (25610), 22360 states have internal predecessors, (25610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22361 states to 22361 states and 25610 transitions. [2023-12-15 19:09:23,513 INFO L78 Accepts]: Start accepts. Automaton has 22361 states and 25610 transitions. Word has length 349 [2023-12-15 19:09:23,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:09:23,514 INFO L495 AbstractCegarLoop]: Abstraction has 22361 states and 25610 transitions. [2023-12-15 19:09:23,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:23,514 INFO L276 IsEmpty]: Start isEmpty. Operand 22361 states and 25610 transitions. [2023-12-15 19:09:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2023-12-15 19:09:23,521 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:09:23,521 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:23,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 19:09:23,521 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:09:23,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:09:23,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1049100023, now seen corresponding path program 1 times [2023-12-15 19:09:23,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:09:23,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122903399] [2023-12-15 19:09:23,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:09:23,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:09:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:09:23,892 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-12-15 19:09:23,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:09:23,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122903399] [2023-12-15 19:09:23,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122903399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:09:23,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:09:23,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 19:09:23,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117655714] [2023-12-15 19:09:23,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:09:23,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 19:09:23,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:09:23,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 19:09:23,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 19:09:23,894 INFO L87 Difference]: Start difference. First operand 22361 states and 25610 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:09:25,664 INFO L93 Difference]: Finished difference Result 55814 states and 63976 transitions. [2023-12-15 19:09:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 19:09:25,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 356 [2023-12-15 19:09:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:09:25,706 INFO L225 Difference]: With dead ends: 55814 [2023-12-15 19:09:25,706 INFO L226 Difference]: Without dead ends: 33015 [2023-12-15 19:09:25,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 19:09:25,726 INFO L413 NwaCegarLoop]: 701 mSDtfsCounter, 395 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-15 19:09:25,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 752 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-15 19:09:25,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33015 states. [2023-12-15 19:09:26,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33015 to 28328. [2023-12-15 19:09:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28328 states, 28327 states have (on average 1.1432908532495498) internal successors, (32386), 28327 states have internal predecessors, (32386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28328 states to 28328 states and 32386 transitions. [2023-12-15 19:09:26,079 INFO L78 Accepts]: Start accepts. Automaton has 28328 states and 32386 transitions. Word has length 356 [2023-12-15 19:09:26,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:09:26,080 INFO L495 AbstractCegarLoop]: Abstraction has 28328 states and 32386 transitions. [2023-12-15 19:09:26,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:26,080 INFO L276 IsEmpty]: Start isEmpty. Operand 28328 states and 32386 transitions. [2023-12-15 19:09:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2023-12-15 19:09:26,088 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:09:26,088 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:26,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 19:09:26,089 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:09:26,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:09:26,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1886740536, now seen corresponding path program 1 times [2023-12-15 19:09:26,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:09:26,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709753518] [2023-12-15 19:09:26,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:09:26,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:09:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:09:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 527 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-12-15 19:09:26,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:09:26,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709753518] [2023-12-15 19:09:26,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709753518] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:09:26,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:09:26,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 19:09:26,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486466130] [2023-12-15 19:09:26,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:09:26,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 19:09:26,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:09:26,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 19:09:26,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 19:09:26,661 INFO L87 Difference]: Start difference. First operand 28328 states and 32386 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:28,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:09:28,501 INFO L93 Difference]: Finished difference Result 70281 states and 80281 transitions. [2023-12-15 19:09:28,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 19:09:28,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 431 [2023-12-15 19:09:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:09:28,548 INFO L225 Difference]: With dead ends: 70281 [2023-12-15 19:09:28,549 INFO L226 Difference]: Without dead ends: 41088 [2023-12-15 19:09:28,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 19:09:28,573 INFO L413 NwaCegarLoop]: 610 mSDtfsCounter, 446 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-15 19:09:28,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 647 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-15 19:09:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41088 states. [2023-12-15 19:09:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41088 to 36399. [2023-12-15 19:09:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36399 states, 36398 states have (on average 1.1283587010275289) internal successors, (41070), 36398 states have internal predecessors, (41070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:29,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36399 states to 36399 states and 41070 transitions. [2023-12-15 19:09:29,041 INFO L78 Accepts]: Start accepts. Automaton has 36399 states and 41070 transitions. Word has length 431 [2023-12-15 19:09:29,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:09:29,042 INFO L495 AbstractCegarLoop]: Abstraction has 36399 states and 41070 transitions. [2023-12-15 19:09:29,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 36399 states and 41070 transitions. [2023-12-15 19:09:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2023-12-15 19:09:29,052 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:09:29,052 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:29,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 19:09:29,053 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:09:29,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:09:29,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1557761263, now seen corresponding path program 1 times [2023-12-15 19:09:29,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:09:29,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877692170] [2023-12-15 19:09:29,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:09:29,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:09:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:09:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-15 19:09:29,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:09:29,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877692170] [2023-12-15 19:09:29,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877692170] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:09:29,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:09:29,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 19:09:29,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205063129] [2023-12-15 19:09:29,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:09:29,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 19:09:29,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:09:29,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 19:09:29,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 19:09:29,723 INFO L87 Difference]: Start difference. First operand 36399 states and 41070 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:32,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:09:32,583 INFO L93 Difference]: Finished difference Result 89019 states and 100634 transitions. [2023-12-15 19:09:32,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 19:09:32,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 435 [2023-12-15 19:09:32,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:09:32,633 INFO L225 Difference]: With dead ends: 89019 [2023-12-15 19:09:32,633 INFO L226 Difference]: Without dead ends: 52621 [2023-12-15 19:09:32,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 19:09:32,645 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 815 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-15 19:09:32,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 200 Invalid, 2799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-15 19:09:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52621 states. [2023-12-15 19:09:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52621 to 47076. [2023-12-15 19:09:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47076 states, 47075 states have (on average 1.1351460435475305) internal successors, (53437), 47075 states have internal predecessors, (53437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47076 states to 47076 states and 53437 transitions. [2023-12-15 19:09:33,133 INFO L78 Accepts]: Start accepts. Automaton has 47076 states and 53437 transitions. Word has length 435 [2023-12-15 19:09:33,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:09:33,133 INFO L495 AbstractCegarLoop]: Abstraction has 47076 states and 53437 transitions. [2023-12-15 19:09:33,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:33,134 INFO L276 IsEmpty]: Start isEmpty. Operand 47076 states and 53437 transitions. [2023-12-15 19:09:33,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2023-12-15 19:09:33,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:09:33,144 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:33,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 19:09:33,145 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:09:33,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:09:33,145 INFO L85 PathProgramCache]: Analyzing trace with hash 310832063, now seen corresponding path program 1 times [2023-12-15 19:09:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:09:33,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820220125] [2023-12-15 19:09:33,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:09:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:09:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:09:33,671 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 566 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-12-15 19:09:33,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:09:33,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820220125] [2023-12-15 19:09:33,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820220125] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:09:33,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:09:33,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 19:09:33,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007190893] [2023-12-15 19:09:33,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:09:33,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 19:09:33,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:09:33,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 19:09:33,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 19:09:33,676 INFO L87 Difference]: Start difference. First operand 47076 states and 53437 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:09:35,585 INFO L93 Difference]: Finished difference Result 112879 states and 128588 transitions. [2023-12-15 19:09:35,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 19:09:35,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 454 [2023-12-15 19:09:35,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:09:35,658 INFO L225 Difference]: With dead ends: 112879 [2023-12-15 19:09:35,658 INFO L226 Difference]: Without dead ends: 65804 [2023-12-15 19:09:35,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 19:09:35,697 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 392 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-15 19:09:35,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 312 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-15 19:09:35,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65804 states. [2023-12-15 19:09:36,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65804 to 64512. [2023-12-15 19:09:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64512 states, 64511 states have (on average 1.127466633597371) internal successors, (72734), 64511 states have internal predecessors, (72734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64512 states to 64512 states and 72734 transitions. [2023-12-15 19:09:36,670 INFO L78 Accepts]: Start accepts. Automaton has 64512 states and 72734 transitions. Word has length 454 [2023-12-15 19:09:36,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:09:36,670 INFO L495 AbstractCegarLoop]: Abstraction has 64512 states and 72734 transitions. [2023-12-15 19:09:36,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 64512 states and 72734 transitions. [2023-12-15 19:09:36,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2023-12-15 19:09:36,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:09:36,682 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 19:09:36,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 19:09:36,682 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:09:36,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:09:36,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1869214909, now seen corresponding path program 1 times [2023-12-15 19:09:36,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:09:36,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596862402] [2023-12-15 19:09:36,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:09:36,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:09:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:09:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-12-15 19:09:37,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:09:37,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596862402] [2023-12-15 19:09:37,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596862402] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:09:37,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:09:37,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 19:09:37,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358992194] [2023-12-15 19:09:37,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:09:37,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 19:09:37,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:09:37,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 19:09:37,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 19:09:37,385 INFO L87 Difference]: Start difference. First operand 64512 states and 72734 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:09:39,496 INFO L93 Difference]: Finished difference Result 142215 states and 159758 transitions. [2023-12-15 19:09:39,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 19:09:39,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 455 [2023-12-15 19:09:39,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:09:39,589 INFO L225 Difference]: With dead ends: 142215 [2023-12-15 19:09:39,589 INFO L226 Difference]: Without dead ends: 77279 [2023-12-15 19:09:39,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 19:09:39,608 INFO L413 NwaCegarLoop]: 754 mSDtfsCounter, 368 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-15 19:09:39,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 806 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-15 19:09:39,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77279 states. [2023-12-15 19:09:40,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77279 to 74708. [2023-12-15 19:09:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74708 states, 74707 states have (on average 1.1155982705770544) internal successors, (83343), 74707 states have internal predecessors, (83343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74708 states to 74708 states and 83343 transitions. [2023-12-15 19:09:40,521 INFO L78 Accepts]: Start accepts. Automaton has 74708 states and 83343 transitions. Word has length 455 [2023-12-15 19:09:40,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:09:40,522 INFO L495 AbstractCegarLoop]: Abstraction has 74708 states and 83343 transitions. [2023-12-15 19:09:40,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:40,522 INFO L276 IsEmpty]: Start isEmpty. Operand 74708 states and 83343 transitions. [2023-12-15 19:09:40,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2023-12-15 19:09:40,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:09:40,534 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 19:09:40,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 19:09:40,535 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:09:40,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:09:40,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1470424771, now seen corresponding path program 1 times [2023-12-15 19:09:40,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:09:40,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689443756] [2023-12-15 19:09:40,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:09:40,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:09:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:09:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2023-12-15 19:09:41,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:09:41,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689443756] [2023-12-15 19:09:41,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689443756] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:09:41,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:09:41,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 19:09:41,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424423795] [2023-12-15 19:09:41,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:09:41,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 19:09:41,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:09:41,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 19:09:41,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 19:09:41,030 INFO L87 Difference]: Start difference. First operand 74708 states and 83343 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:09:42,785 INFO L93 Difference]: Finished difference Result 158784 states and 177329 transitions. [2023-12-15 19:09:42,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 19:09:42,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 473 [2023-12-15 19:09:42,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:09:42,873 INFO L225 Difference]: With dead ends: 158784 [2023-12-15 19:09:42,873 INFO L226 Difference]: Without dead ends: 84077 [2023-12-15 19:09:43,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 19:09:43,049 INFO L413 NwaCegarLoop]: 705 mSDtfsCounter, 338 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-15 19:09:43,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 758 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-15 19:09:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84077 states. [2023-12-15 19:09:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84077 to 75529. [2023-12-15 19:09:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75529 states, 75528 states have (on average 1.1046764113970977) internal successors, (83434), 75528 states have internal predecessors, (83434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75529 states to 75529 states and 83434 transitions. [2023-12-15 19:09:44,067 INFO L78 Accepts]: Start accepts. Automaton has 75529 states and 83434 transitions. Word has length 473 [2023-12-15 19:09:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:09:44,068 INFO L495 AbstractCegarLoop]: Abstraction has 75529 states and 83434 transitions. [2023-12-15 19:09:44,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 19:09:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 75529 states and 83434 transitions. [2023-12-15 19:09:44,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2023-12-15 19:09:44,080 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:09:44,080 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:44,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 19:09:44,080 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:09:44,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:09:44,081 INFO L85 PathProgramCache]: Analyzing trace with hash 365353125, now seen corresponding path program 1 times [2023-12-15 19:09:44,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:09:44,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784803103] [2023-12-15 19:09:44,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:09:44,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:09:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-15 19:09:44,293 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 19:09:44,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 19:09:44,294 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 19:09:44,299 INFO L158 Benchmark]: Toolchain (without parser) took 52878.41ms. Allocated memory was 303.0MB in the beginning and 4.7GB in the end (delta: 4.4GB). Free memory was 240.8MB in the beginning and 3.4GB in the end (delta: -3.1GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-12-15 19:09:44,299 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 210.8MB. Free memory was 159.7MB in the beginning and 159.6MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 19:09:44,300 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1104.50ms. Allocated memory is still 303.0MB. Free memory was 240.5MB in the beginning and 176.3MB in the end (delta: 64.2MB). Peak memory consumption was 65.0MB. Max. memory is 8.0GB. [2023-12-15 19:09:44,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 333.65ms. Allocated memory is still 303.0MB. Free memory was 176.3MB in the beginning and 223.3MB in the end (delta: -47.0MB). Peak memory consumption was 85.1MB. Max. memory is 8.0GB. [2023-12-15 19:09:44,300 INFO L158 Benchmark]: Boogie Preprocessor took 535.39ms. Allocated memory was 303.0MB in the beginning and 567.3MB in the end (delta: 264.2MB). Free memory was 223.3MB in the beginning and 464.3MB in the end (delta: -241.0MB). Peak memory consumption was 65.2MB. Max. memory is 8.0GB. [2023-12-15 19:09:44,301 INFO L158 Benchmark]: RCFGBuilder took 3268.56ms. Allocated memory is still 567.3MB. Free memory was 464.3MB in the beginning and 340.0MB in the end (delta: 124.3MB). Peak memory consumption was 160.0MB. Max. memory is 8.0GB. [2023-12-15 19:09:44,301 INFO L158 Benchmark]: TraceAbstraction took 47627.88ms. Allocated memory was 567.3MB in the beginning and 4.7GB in the end (delta: 4.1GB). Free memory was 339.4MB in the beginning and 3.4GB in the end (delta: -3.0GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2023-12-15 19:09:44,302 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.49ms. Allocated memory is still 210.8MB. Free memory was 159.7MB in the beginning and 159.6MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1104.50ms. Allocated memory is still 303.0MB. Free memory was 240.5MB in the beginning and 176.3MB in the end (delta: 64.2MB). Peak memory consumption was 65.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 333.65ms. Allocated memory is still 303.0MB. Free memory was 176.3MB in the beginning and 223.3MB in the end (delta: -47.0MB). Peak memory consumption was 85.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 535.39ms. Allocated memory was 303.0MB in the beginning and 567.3MB in the end (delta: 264.2MB). Free memory was 223.3MB in the beginning and 464.3MB in the end (delta: -241.0MB). Peak memory consumption was 65.2MB. Max. memory is 8.0GB. * RCFGBuilder took 3268.56ms. Allocated memory is still 567.3MB. Free memory was 464.3MB in the beginning and 340.0MB in the end (delta: 124.3MB). Peak memory consumption was 160.0MB. Max. memory is 8.0GB. * TraceAbstraction took 47627.88ms. Allocated memory was 567.3MB in the beginning and 4.7GB in the end (delta: 4.1GB). Free memory was 339.4MB in the beginning and 3.4GB in the end (delta: -3.0GB). Peak memory consumption was 1.0GB. 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