/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/locks/test_locks_12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 18:10:46,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 18:10:46,435 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 18:10:46,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 18:10:46,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 18:10:46,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 18:10:46,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 18:10:46,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 18:10:46,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 18:10:46,475 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 18:10:46,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 18:10:46,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 18:10:46,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 18:10:46,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 18:10:46,477 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 18:10:46,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 18:10:46,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 18:10:46,478 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 18:10:46,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 18:10:46,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 18:10:46,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 18:10:46,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 18:10:46,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 18:10:46,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 18:10:46,480 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 18:10:46,480 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 18:10:46,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 18:10:46,480 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 18:10:46,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 18:10:46,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 18:10:46,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 18:10:46,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 18:10:46,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 18:10:46,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 18:10:46,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 18:10:46,482 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 18:10:46,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 18:10:46,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 18:10:46,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 18:10:46,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 18:10:46,482 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 18:10:46,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 18:10:46,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 18:10:46,483 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 18:10:46,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 18:10:46,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 18:10:46,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 18:10:46,713 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 18:10:46,713 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 18:10:46,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2023-12-15 18:10:47,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 18:10:47,940 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 18:10:47,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2023-12-15 18:10:47,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79751e74/95ba237c87bd495c9c4ab265c1c056a6/FLAG418d4b446 [2023-12-15 18:10:47,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79751e74/95ba237c87bd495c9c4ab265c1c056a6 [2023-12-15 18:10:47,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 18:10:47,965 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 18:10:47,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 18:10:47,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 18:10:47,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 18:10:47,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 06:10:47" (1/1) ... [2023-12-15 18:10:47,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d6f36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:47, skipping insertion in model container [2023-12-15 18:10:47,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 06:10:47" (1/1) ... [2023-12-15 18:10:47,999 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 18:10:48,102 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c[4591,4604] [2023-12-15 18:10:48,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 18:10:48,112 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 18:10:48,128 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c[4591,4604] [2023-12-15 18:10:48,129 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 18:10:48,138 INFO L206 MainTranslator]: Completed translation [2023-12-15 18:10:48,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48 WrapperNode [2023-12-15 18:10:48,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 18:10:48,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 18:10:48,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 18:10:48,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 18:10:48,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,161 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 172 [2023-12-15 18:10:48,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 18:10:48,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 18:10:48,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 18:10:48,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 18:10:48,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,178 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 18:10:48,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,180 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 18:10:48,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 18:10:48,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 18:10:48,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 18:10:48,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 18:10:48,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:10:48,224 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 18:10:48,240 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 18:10:48,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 18:10:48,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 18:10:48,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 18:10:48,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 18:10:48,333 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 18:10:48,334 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 18:10:48,609 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 18:10:48,641 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 18:10:48,641 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 18:10:48,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 06:10:48 BoogieIcfgContainer [2023-12-15 18:10:48,642 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 18:10:48,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 18:10:48,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 18:10:48,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 18:10:48,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 06:10:47" (1/3) ... [2023-12-15 18:10:48,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e105f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 06:10:48, skipping insertion in model container [2023-12-15 18:10:48,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (2/3) ... [2023-12-15 18:10:48,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e105f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 06:10:48, skipping insertion in model container [2023-12-15 18:10:48,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 06:10:48" (3/3) ... [2023-12-15 18:10:48,656 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2023-12-15 18:10:48,683 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 18:10:48,684 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 18:10:48,745 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 18:10:48,756 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;@477eaa01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 18:10:48,756 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 18:10:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 43 states have internal predecessors, (82), 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 18:10:48,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-15 18:10:48,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:48,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:10:48,785 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:48,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:48,805 INFO L85 PathProgramCache]: Analyzing trace with hash -787416365, now seen corresponding path program 1 times [2023-12-15 18:10:48,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:48,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892408257] [2023-12-15 18:10:48,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:48,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,055 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 18:10:49,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892408257] [2023-12-15 18:10:49,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892408257] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288359721] [2023-12-15 18:10:49,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,081 INFO L87 Difference]: Start difference. First operand has 44 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 43 states have internal predecessors, (82), 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 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18:10:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,135 INFO L93 Difference]: Finished difference Result 90 states and 165 transitions. [2023-12-15 18:10:49,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2023-12-15 18:10:49,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,147 INFO L225 Difference]: With dead ends: 90 [2023-12-15 18:10:49,147 INFO L226 Difference]: Without dead ends: 80 [2023-12-15 18:10:49,149 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 18:10:49,151 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 60 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 154 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-15 18:10:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2023-12-15 18:10:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 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 18:10:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 101 transitions. [2023-12-15 18:10:49,181 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 101 transitions. Word has length 18 [2023-12-15 18:10:49,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,181 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 101 transitions. [2023-12-15 18:10:49,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18:10:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 101 transitions. [2023-12-15 18:10:49,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-15 18:10:49,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:10:49,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 18:10:49,183 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2067280043, now seen corresponding path program 1 times [2023-12-15 18:10:49,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493597488] [2023-12-15 18:10:49,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,230 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 18:10:49,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493597488] [2023-12-15 18:10:49,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493597488] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490312569] [2023-12-15 18:10:49,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,233 INFO L87 Difference]: Start difference. First operand 54 states and 101 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18:10:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,254 INFO L93 Difference]: Finished difference Result 133 states and 248 transitions. [2023-12-15 18:10:49,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2023-12-15 18:10:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,256 INFO L225 Difference]: With dead ends: 133 [2023-12-15 18:10:49,256 INFO L226 Difference]: Without dead ends: 80 [2023-12-15 18:10:49,257 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 18:10:49,258 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 58 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 168 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-15 18:10:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2023-12-15 18:10:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.8831168831168832) internal successors, (145), 77 states have internal predecessors, (145), 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 18:10:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 145 transitions. [2023-12-15 18:10:49,264 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 145 transitions. Word has length 18 [2023-12-15 18:10:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,265 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 145 transitions. [2023-12-15 18:10:49,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18:10:49,265 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 145 transitions. [2023-12-15 18:10:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-15 18:10:49,265 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:10:49,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 18:10:49,266 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1360109161, now seen corresponding path program 1 times [2023-12-15 18:10:49,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145420618] [2023-12-15 18:10:49,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,305 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 18:10:49,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145420618] [2023-12-15 18:10:49,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145420618] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276181160] [2023-12-15 18:10:49,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,307 INFO L87 Difference]: Start difference. First operand 78 states and 145 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 18:10:49,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,319 INFO L93 Difference]: Finished difference Result 122 states and 221 transitions. [2023-12-15 18:10:49,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2023-12-15 18:10:49,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,320 INFO L225 Difference]: With dead ends: 122 [2023-12-15 18:10:49,320 INFO L226 Difference]: Without dead ends: 83 [2023-12-15 18:10:49,320 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 18:10:49,321 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 60 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-15 18:10:49,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2023-12-15 18:10:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.8375) internal successors, (147), 80 states have internal predecessors, (147), 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 18:10:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 147 transitions. [2023-12-15 18:10:49,328 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 147 transitions. Word has length 19 [2023-12-15 18:10:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,328 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 147 transitions. [2023-12-15 18:10:49,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 18:10:49,328 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 147 transitions. [2023-12-15 18:10:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-15 18:10:49,329 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:10:49,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 18:10:49,329 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash 339040807, now seen corresponding path program 1 times [2023-12-15 18:10:49,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28538151] [2023-12-15 18:10:49,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,370 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 18:10:49,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28538151] [2023-12-15 18:10:49,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28538151] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965831003] [2023-12-15 18:10:49,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,372 INFO L87 Difference]: Start difference. First operand 81 states and 147 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 18:10:49,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,385 INFO L93 Difference]: Finished difference Result 156 states and 284 transitions. [2023-12-15 18:10:49,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2023-12-15 18:10:49,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,389 INFO L225 Difference]: With dead ends: 156 [2023-12-15 18:10:49,389 INFO L226 Difference]: Without dead ends: 154 [2023-12-15 18:10:49,390 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 18:10:49,391 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 55 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-15 18:10:49,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 108. [2023-12-15 18:10:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.8317757009345794) internal successors, (196), 107 states have internal predecessors, (196), 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 18:10:49,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 196 transitions. [2023-12-15 18:10:49,401 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 196 transitions. Word has length 19 [2023-12-15 18:10:49,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,405 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 196 transitions. [2023-12-15 18:10:49,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 18:10:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 196 transitions. [2023-12-15 18:10:49,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-15 18:10:49,406 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:10:49,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 18:10:49,407 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash -940822871, now seen corresponding path program 1 times [2023-12-15 18:10:49,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399855409] [2023-12-15 18:10:49,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,436 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 18:10:49,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399855409] [2023-12-15 18:10:49,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399855409] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628853792] [2023-12-15 18:10:49,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,439 INFO L87 Difference]: Start difference. First operand 108 states and 196 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 18:10:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,453 INFO L93 Difference]: Finished difference Result 260 states and 474 transitions. [2023-12-15 18:10:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2023-12-15 18:10:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,454 INFO L225 Difference]: With dead ends: 260 [2023-12-15 18:10:49,454 INFO L226 Difference]: Without dead ends: 156 [2023-12-15 18:10:49,455 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 18:10:49,456 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 57 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 169 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-15 18:10:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2023-12-15 18:10:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.8169934640522876) internal successors, (278), 153 states have internal predecessors, (278), 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 18:10:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 278 transitions. [2023-12-15 18:10:49,465 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 278 transitions. Word has length 19 [2023-12-15 18:10:49,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,465 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 278 transitions. [2023-12-15 18:10:49,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 18:10:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 278 transitions. [2023-12-15 18:10:49,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-15 18:10:49,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,466 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] [2023-12-15 18:10:49,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 18:10:49,466 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1920543466, now seen corresponding path program 1 times [2023-12-15 18:10:49,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942799877] [2023-12-15 18:10:49,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,492 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 18:10:49,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942799877] [2023-12-15 18:10:49,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942799877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316066205] [2023-12-15 18:10:49,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,494 INFO L87 Difference]: Start difference. First operand 154 states and 278 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 18:10:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,517 INFO L93 Difference]: Finished difference Result 233 states and 417 transitions. [2023-12-15 18:10:49,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2023-12-15 18:10:49,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,519 INFO L225 Difference]: With dead ends: 233 [2023-12-15 18:10:49,519 INFO L226 Difference]: Without dead ends: 158 [2023-12-15 18:10:49,522 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 18:10:49,529 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 59 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 185 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-12-15 18:10:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2023-12-15 18:10:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.793548387096774) internal successors, (278), 155 states have internal predecessors, (278), 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 18:10:49,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 278 transitions. [2023-12-15 18:10:49,538 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 278 transitions. Word has length 20 [2023-12-15 18:10:49,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,538 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 278 transitions. [2023-12-15 18:10:49,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 18:10:49,539 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 278 transitions. [2023-12-15 18:10:49,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-15 18:10:49,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,539 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] [2023-12-15 18:10:49,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 18:10:49,540 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,541 INFO L85 PathProgramCache]: Analyzing trace with hash 899475112, now seen corresponding path program 1 times [2023-12-15 18:10:49,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690122314] [2023-12-15 18:10:49,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,565 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 18:10:49,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690122314] [2023-12-15 18:10:49,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690122314] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803912080] [2023-12-15 18:10:49,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,567 INFO L87 Difference]: Start difference. First operand 156 states and 278 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 18:10:49,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,579 INFO L93 Difference]: Finished difference Result 452 states and 808 transitions. [2023-12-15 18:10:49,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2023-12-15 18:10:49,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,581 INFO L225 Difference]: With dead ends: 452 [2023-12-15 18:10:49,581 INFO L226 Difference]: Without dead ends: 302 [2023-12-15 18:10:49,582 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 18:10:49,582 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 57 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 148 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-12-15 18:10:49,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2023-12-15 18:10:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.7725752508361203) internal successors, (530), 299 states have internal predecessors, (530), 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 18:10:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 530 transitions. [2023-12-15 18:10:49,595 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 530 transitions. Word has length 20 [2023-12-15 18:10:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,595 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 530 transitions. [2023-12-15 18:10:49,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 18:10:49,595 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 530 transitions. [2023-12-15 18:10:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-15 18:10:49,596 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,596 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] [2023-12-15 18:10:49,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 18:10:49,596 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2115628506, now seen corresponding path program 1 times [2023-12-15 18:10:49,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799080028] [2023-12-15 18:10:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,622 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 18:10:49,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799080028] [2023-12-15 18:10:49,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799080028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527571414] [2023-12-15 18:10:49,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,624 INFO L87 Difference]: Start difference. First operand 300 states and 530 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 18:10:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,640 INFO L93 Difference]: Finished difference Result 384 states and 684 transitions. [2023-12-15 18:10:49,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2023-12-15 18:10:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,642 INFO L225 Difference]: With dead ends: 384 [2023-12-15 18:10:49,642 INFO L226 Difference]: Without dead ends: 382 [2023-12-15 18:10:49,642 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 18:10:49,642 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 52 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 203 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2023-12-15 18:10:49,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 300. [2023-12-15 18:10:49,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.7591973244147157) internal successors, (526), 299 states have internal predecessors, (526), 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 18:10:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 526 transitions. [2023-12-15 18:10:49,652 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 526 transitions. Word has length 20 [2023-12-15 18:10:49,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,653 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 526 transitions. [2023-12-15 18:10:49,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 18:10:49,653 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 526 transitions. [2023-12-15 18:10:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-15 18:10:49,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,654 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] [2023-12-15 18:10:49,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 18:10:49,654 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2114138078, now seen corresponding path program 1 times [2023-12-15 18:10:49,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113507198] [2023-12-15 18:10:49,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,687 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 18:10:49,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113507198] [2023-12-15 18:10:49,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113507198] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065568551] [2023-12-15 18:10:49,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,689 INFO L87 Difference]: Start difference. First operand 300 states and 526 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 18:10:49,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,710 INFO L93 Difference]: Finished difference Result 564 states and 1000 transitions. [2023-12-15 18:10:49,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2023-12-15 18:10:49,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,713 INFO L225 Difference]: With dead ends: 564 [2023-12-15 18:10:49,713 INFO L226 Difference]: Without dead ends: 562 [2023-12-15 18:10:49,715 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 18:10:49,718 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 49 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 142 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2023-12-15 18:10:49,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 416. [2023-12-15 18:10:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 1.730120481927711) internal successors, (718), 415 states have internal predecessors, (718), 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 18:10:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 718 transitions. [2023-12-15 18:10:49,739 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 718 transitions. Word has length 21 [2023-12-15 18:10:49,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,739 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 718 transitions. [2023-12-15 18:10:49,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 18:10:49,740 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 718 transitions. [2023-12-15 18:10:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-15 18:10:49,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,745 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] [2023-12-15 18:10:49,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 18:10:49,745 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,746 INFO L85 PathProgramCache]: Analyzing trace with hash 834274400, now seen corresponding path program 1 times [2023-12-15 18:10:49,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107996042] [2023-12-15 18:10:49,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,783 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 18:10:49,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107996042] [2023-12-15 18:10:49,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107996042] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577146011] [2023-12-15 18:10:49,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,785 INFO L87 Difference]: Start difference. First operand 416 states and 718 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 18:10:49,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,804 INFO L93 Difference]: Finished difference Result 996 states and 1728 transitions. [2023-12-15 18:10:49,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2023-12-15 18:10:49,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,806 INFO L225 Difference]: With dead ends: 996 [2023-12-15 18:10:49,806 INFO L226 Difference]: Without dead ends: 586 [2023-12-15 18:10:49,807 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 18:10:49,808 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 55 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 171 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2023-12-15 18:10:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2023-12-15 18:10:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 583 states have (on average 1.718696397941681) internal successors, (1002), 583 states have internal predecessors, (1002), 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 18:10:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1002 transitions. [2023-12-15 18:10:49,824 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1002 transitions. Word has length 21 [2023-12-15 18:10:49,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,825 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 1002 transitions. [2023-12-15 18:10:49,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 18:10:49,825 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1002 transitions. [2023-12-15 18:10:49,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-15 18:10:49,826 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,826 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] [2023-12-15 18:10:49,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 18:10:49,826 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1113984701, now seen corresponding path program 1 times [2023-12-15 18:10:49,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018349413] [2023-12-15 18:10:49,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,857 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 18:10:49,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018349413] [2023-12-15 18:10:49,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018349413] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546610480] [2023-12-15 18:10:49,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,859 INFO L87 Difference]: Start difference. First operand 584 states and 1002 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 18:10:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,896 INFO L93 Difference]: Finished difference Result 884 states and 1512 transitions. [2023-12-15 18:10:49,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2023-12-15 18:10:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,899 INFO L225 Difference]: With dead ends: 884 [2023-12-15 18:10:49,899 INFO L226 Difference]: Without dead ends: 598 [2023-12-15 18:10:49,900 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 18:10:49,900 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 57 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2023-12-15 18:10:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2023-12-15 18:10:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.6974789915966386) internal successors, (1010), 595 states have internal predecessors, (1010), 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 18:10:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1010 transitions. [2023-12-15 18:10:49,911 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1010 transitions. Word has length 22 [2023-12-15 18:10:49,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,911 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 1010 transitions. [2023-12-15 18:10:49,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 18:10:49,912 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1010 transitions. [2023-12-15 18:10:49,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-15 18:10:49,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,913 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] [2023-12-15 18:10:49,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 18:10:49,913 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,915 INFO L85 PathProgramCache]: Analyzing trace with hash 92916347, now seen corresponding path program 1 times [2023-12-15 18:10:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685670701] [2023-12-15 18:10:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,947 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 18:10:49,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685670701] [2023-12-15 18:10:49,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685670701] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796809752] [2023-12-15 18:10:49,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,948 INFO L87 Difference]: Start difference. First operand 596 states and 1010 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 18:10:49,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,966 INFO L93 Difference]: Finished difference Result 1096 states and 1884 transitions. [2023-12-15 18:10:49,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2023-12-15 18:10:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,973 INFO L225 Difference]: With dead ends: 1096 [2023-12-15 18:10:49,973 INFO L226 Difference]: Without dead ends: 1094 [2023-12-15 18:10:49,973 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 18:10:49,974 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 46 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 140 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2023-12-15 18:10:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 836. [2023-12-15 18:10:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 835 states have (on average 1.659880239520958) internal successors, (1386), 835 states have internal predecessors, (1386), 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 18:10:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1386 transitions. [2023-12-15 18:10:49,988 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1386 transitions. Word has length 22 [2023-12-15 18:10:49,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,989 INFO L495 AbstractCegarLoop]: Abstraction has 836 states and 1386 transitions. [2023-12-15 18:10:49,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 18:10:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1386 transitions. [2023-12-15 18:10:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-15 18:10:49,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,990 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] [2023-12-15 18:10:49,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 18:10:49,990 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1186947331, now seen corresponding path program 1 times [2023-12-15 18:10:49,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110726569] [2023-12-15 18:10:49,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,024 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 18:10:50,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110726569] [2023-12-15 18:10:50,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110726569] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401333856] [2023-12-15 18:10:50,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,026 INFO L87 Difference]: Start difference. First operand 836 states and 1386 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 18:10:50,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,050 INFO L93 Difference]: Finished difference Result 1976 states and 3292 transitions. [2023-12-15 18:10:50,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2023-12-15 18:10:50,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,054 INFO L225 Difference]: With dead ends: 1976 [2023-12-15 18:10:50,054 INFO L226 Difference]: Without dead ends: 1158 [2023-12-15 18:10:50,054 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 18:10:50,055 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 54 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 172 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2023-12-15 18:10:50,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2023-12-15 18:10:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.6502164502164502) internal successors, (1906), 1155 states have internal predecessors, (1906), 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 18:10:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1906 transitions. [2023-12-15 18:10:50,077 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1906 transitions. Word has length 22 [2023-12-15 18:10:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:50,077 INFO L495 AbstractCegarLoop]: Abstraction has 1156 states and 1906 transitions. [2023-12-15 18:10:50,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 18:10:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1906 transitions. [2023-12-15 18:10:50,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 18:10:50,078 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:50,078 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] [2023-12-15 18:10:50,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 18:10:50,078 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:50,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:50,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1414346475, now seen corresponding path program 1 times [2023-12-15 18:10:50,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:50,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281731864] [2023-12-15 18:10:50,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:50,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,102 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 18:10:50,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281731864] [2023-12-15 18:10:50,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281731864] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162984850] [2023-12-15 18:10:50,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,103 INFO L87 Difference]: Start difference. First operand 1156 states and 1906 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 18:10:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,124 INFO L93 Difference]: Finished difference Result 1736 states and 2852 transitions. [2023-12-15 18:10:50,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2023-12-15 18:10:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,128 INFO L225 Difference]: With dead ends: 1736 [2023-12-15 18:10:50,129 INFO L226 Difference]: Without dead ends: 1174 [2023-12-15 18:10:50,129 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 18:10:50,130 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 56 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 173 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2023-12-15 18:10:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1172. [2023-12-15 18:10:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1171 states have (on average 1.627668659265585) internal successors, (1906), 1171 states have internal predecessors, (1906), 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 18:10:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1906 transitions. [2023-12-15 18:10:50,154 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1906 transitions. Word has length 23 [2023-12-15 18:10:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:50,155 INFO L495 AbstractCegarLoop]: Abstraction has 1172 states and 1906 transitions. [2023-12-15 18:10:50,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 18:10:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1906 transitions. [2023-12-15 18:10:50,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 18:10:50,156 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:50,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] [2023-12-15 18:10:50,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 18:10:50,156 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:50,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:50,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1859552467, now seen corresponding path program 1 times [2023-12-15 18:10:50,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:50,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223755125] [2023-12-15 18:10:50,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:50,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,180 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 18:10:50,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223755125] [2023-12-15 18:10:50,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223755125] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017663687] [2023-12-15 18:10:50,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,181 INFO L87 Difference]: Start difference. First operand 1172 states and 1906 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 18:10:50,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,209 INFO L93 Difference]: Finished difference Result 2120 states and 3508 transitions. [2023-12-15 18:10:50,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2023-12-15 18:10:50,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,215 INFO L225 Difference]: With dead ends: 2120 [2023-12-15 18:10:50,215 INFO L226 Difference]: Without dead ends: 2118 [2023-12-15 18:10:50,216 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 18:10:50,217 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 43 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 138 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2023-12-15 18:10:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 1668. [2023-12-15 18:10:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1667 states have (on average 1.5848830233953208) internal successors, (2642), 1667 states have internal predecessors, (2642), 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 18:10:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2642 transitions. [2023-12-15 18:10:50,251 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2642 transitions. Word has length 23 [2023-12-15 18:10:50,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:50,251 INFO L495 AbstractCegarLoop]: Abstraction has 1668 states and 2642 transitions. [2023-12-15 18:10:50,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 18:10:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2642 transitions. [2023-12-15 18:10:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 18:10:50,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:50,253 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] [2023-12-15 18:10:50,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 18:10:50,253 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:50,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:50,253 INFO L85 PathProgramCache]: Analyzing trace with hash 579688789, now seen corresponding path program 1 times [2023-12-15 18:10:50,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:50,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101868482] [2023-12-15 18:10:50,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:50,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,271 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 18:10:50,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101868482] [2023-12-15 18:10:50,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101868482] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068696727] [2023-12-15 18:10:50,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,273 INFO L87 Difference]: Start difference. First operand 1668 states and 2642 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 18:10:50,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,319 INFO L93 Difference]: Finished difference Result 3912 states and 6228 transitions. [2023-12-15 18:10:50,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2023-12-15 18:10:50,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,325 INFO L225 Difference]: With dead ends: 3912 [2023-12-15 18:10:50,325 INFO L226 Difference]: Without dead ends: 2278 [2023-12-15 18:10:50,327 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 18:10:50,328 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 173 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2023-12-15 18:10:50,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2276. [2023-12-15 18:10:50,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2276 states, 2275 states have (on average 1.5762637362637362) internal successors, (3586), 2275 states have internal predecessors, (3586), 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 18:10:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 3586 transitions. [2023-12-15 18:10:50,378 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 3586 transitions. Word has length 23 [2023-12-15 18:10:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:50,379 INFO L495 AbstractCegarLoop]: Abstraction has 2276 states and 3586 transitions. [2023-12-15 18:10:50,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 18:10:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 3586 transitions. [2023-12-15 18:10:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-15 18:10:50,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:50,381 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] [2023-12-15 18:10:50,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 18:10:50,381 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:50,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:50,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1811766034, now seen corresponding path program 1 times [2023-12-15 18:10:50,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:50,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113291083] [2023-12-15 18:10:50,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:50,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,398 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 18:10:50,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113291083] [2023-12-15 18:10:50,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113291083] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883026850] [2023-12-15 18:10:50,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,399 INFO L87 Difference]: Start difference. First operand 2276 states and 3586 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 18:10:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,433 INFO L93 Difference]: Finished difference Result 3416 states and 5364 transitions. [2023-12-15 18:10:50,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2023-12-15 18:10:50,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,439 INFO L225 Difference]: With dead ends: 3416 [2023-12-15 18:10:50,439 INFO L226 Difference]: Without dead ends: 2310 [2023-12-15 18:10:50,441 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 18:10:50,441 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 55 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 169 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2023-12-15 18:10:50,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2308. [2023-12-15 18:10:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 2307 states have (on average 1.554399653229302) internal successors, (3586), 2307 states have internal predecessors, (3586), 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 18:10:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 3586 transitions. [2023-12-15 18:10:50,492 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 3586 transitions. Word has length 24 [2023-12-15 18:10:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:50,492 INFO L495 AbstractCegarLoop]: Abstraction has 2308 states and 3586 transitions. [2023-12-15 18:10:50,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 18:10:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3586 transitions. [2023-12-15 18:10:50,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-15 18:10:50,493 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:50,493 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] [2023-12-15 18:10:50,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 18:10:50,494 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:50,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:50,494 INFO L85 PathProgramCache]: Analyzing trace with hash 790697680, now seen corresponding path program 1 times [2023-12-15 18:10:50,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:50,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620256952] [2023-12-15 18:10:50,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:50,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,508 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 18:10:50,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620256952] [2023-12-15 18:10:50,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620256952] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329542537] [2023-12-15 18:10:50,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,509 INFO L87 Difference]: Start difference. First operand 2308 states and 3586 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 18:10:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,564 INFO L93 Difference]: Finished difference Result 4104 states and 6500 transitions. [2023-12-15 18:10:50,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2023-12-15 18:10:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,575 INFO L225 Difference]: With dead ends: 4104 [2023-12-15 18:10:50,575 INFO L226 Difference]: Without dead ends: 4102 [2023-12-15 18:10:50,576 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 18:10:50,576 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 40 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2023-12-15 18:10:50,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 3332. [2023-12-15 18:10:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3332 states, 3331 states have (on average 1.5088561993395377) internal successors, (5026), 3331 states have internal predecessors, (5026), 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 18:10:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 5026 transitions. [2023-12-15 18:10:50,682 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 5026 transitions. Word has length 24 [2023-12-15 18:10:50,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:50,682 INFO L495 AbstractCegarLoop]: Abstraction has 3332 states and 5026 transitions. [2023-12-15 18:10:50,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 18:10:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 5026 transitions. [2023-12-15 18:10:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-15 18:10:50,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:50,686 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] [2023-12-15 18:10:50,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 18:10:50,686 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:50,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:50,687 INFO L85 PathProgramCache]: Analyzing trace with hash -489165998, now seen corresponding path program 1 times [2023-12-15 18:10:50,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:50,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198548563] [2023-12-15 18:10:50,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:50,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,714 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 18:10:50,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198548563] [2023-12-15 18:10:50,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198548563] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193795680] [2023-12-15 18:10:50,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,716 INFO L87 Difference]: Start difference. First operand 3332 states and 5026 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 18:10:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,801 INFO L93 Difference]: Finished difference Result 7752 states and 11748 transitions. [2023-12-15 18:10:50,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2023-12-15 18:10:50,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,813 INFO L225 Difference]: With dead ends: 7752 [2023-12-15 18:10:50,813 INFO L226 Difference]: Without dead ends: 4486 [2023-12-15 18:10:50,816 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 18:10:50,817 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 174 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2023-12-15 18:10:50,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 4484. [2023-12-15 18:10:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4484 states, 4483 states have (on average 1.4994423377202766) internal successors, (6722), 4483 states have internal predecessors, (6722), 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 18:10:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 6722 transitions. [2023-12-15 18:10:50,917 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 6722 transitions. Word has length 24 [2023-12-15 18:10:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:50,917 INFO L495 AbstractCegarLoop]: Abstraction has 4484 states and 6722 transitions. [2023-12-15 18:10:50,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 18:10:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 6722 transitions. [2023-12-15 18:10:50,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-15 18:10:50,921 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:50,921 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] [2023-12-15 18:10:50,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 18:10:50,921 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:50,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:50,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1257960950, now seen corresponding path program 1 times [2023-12-15 18:10:50,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:50,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377376537] [2023-12-15 18:10:50,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:50,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,938 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 18:10:50,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377376537] [2023-12-15 18:10:50,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377376537] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179261779] [2023-12-15 18:10:50,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,939 INFO L87 Difference]: Start difference. First operand 4484 states and 6722 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 18:10:51,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:51,030 INFO L93 Difference]: Finished difference Result 6728 states and 10052 transitions. [2023-12-15 18:10:51,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:51,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2023-12-15 18:10:51,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:51,050 INFO L225 Difference]: With dead ends: 6728 [2023-12-15 18:10:51,050 INFO L226 Difference]: Without dead ends: 4550 [2023-12-15 18:10:51,052 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 18:10:51,053 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 54 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:51,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:51,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2023-12-15 18:10:51,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 4548. [2023-12-15 18:10:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4548 states, 4547 states have (on average 1.4783373652957994) internal successors, (6722), 4547 states have internal predecessors, (6722), 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 18:10:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 6722 transitions. [2023-12-15 18:10:51,155 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 6722 transitions. Word has length 25 [2023-12-15 18:10:51,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:51,155 INFO L495 AbstractCegarLoop]: Abstraction has 4548 states and 6722 transitions. [2023-12-15 18:10:51,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 18:10:51,155 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 6722 transitions. [2023-12-15 18:10:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-15 18:10:51,158 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:51,158 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] [2023-12-15 18:10:51,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 18:10:51,159 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:51,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:51,159 INFO L85 PathProgramCache]: Analyzing trace with hash 2015937992, now seen corresponding path program 1 times [2023-12-15 18:10:51,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:51,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901289133] [2023-12-15 18:10:51,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:51,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:51,173 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 18:10:51,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:51,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901289133] [2023-12-15 18:10:51,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901289133] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:51,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:51,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:51,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062756786] [2023-12-15 18:10:51,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:51,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:51,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:51,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:51,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:51,175 INFO L87 Difference]: Start difference. First operand 4548 states and 6722 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 18:10:51,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:51,261 INFO L93 Difference]: Finished difference Result 7944 states and 11972 transitions. [2023-12-15 18:10:51,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:51,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2023-12-15 18:10:51,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:51,274 INFO L225 Difference]: With dead ends: 7944 [2023-12-15 18:10:51,274 INFO L226 Difference]: Without dead ends: 7942 [2023-12-15 18:10:51,277 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 18:10:51,277 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 37 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:51,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:51,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7942 states. [2023-12-15 18:10:51,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7942 to 6660. [2023-12-15 18:10:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6660 states, 6659 states have (on average 1.432347199279171) internal successors, (9538), 6659 states have internal predecessors, (9538), 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 18:10:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 9538 transitions. [2023-12-15 18:10:51,428 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 9538 transitions. Word has length 25 [2023-12-15 18:10:51,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:51,428 INFO L495 AbstractCegarLoop]: Abstraction has 6660 states and 9538 transitions. [2023-12-15 18:10:51,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 18:10:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 9538 transitions. [2023-12-15 18:10:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-15 18:10:51,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:51,434 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] [2023-12-15 18:10:51,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-15 18:10:51,434 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:51,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:51,434 INFO L85 PathProgramCache]: Analyzing trace with hash 736074314, now seen corresponding path program 1 times [2023-12-15 18:10:51,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:51,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853475021] [2023-12-15 18:10:51,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:51,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:51,451 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 18:10:51,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:51,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853475021] [2023-12-15 18:10:51,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853475021] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:51,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:51,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:51,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620450413] [2023-12-15 18:10:51,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:51,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:51,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:51,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:51,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:51,453 INFO L87 Difference]: Start difference. First operand 6660 states and 9538 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 18:10:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:51,562 INFO L93 Difference]: Finished difference Result 15368 states and 22084 transitions. [2023-12-15 18:10:51,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:51,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2023-12-15 18:10:51,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:51,608 INFO L225 Difference]: With dead ends: 15368 [2023-12-15 18:10:51,608 INFO L226 Difference]: Without dead ends: 8838 [2023-12-15 18:10:51,612 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 18:10:51,613 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 51 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:51,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 175 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8838 states. [2023-12-15 18:10:51,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8838 to 8836. [2023-12-15 18:10:51,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8836 states, 8835 states have (on average 1.4200339558573853) internal successors, (12546), 8835 states have internal predecessors, (12546), 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 18:10:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8836 states to 8836 states and 12546 transitions. [2023-12-15 18:10:51,776 INFO L78 Accepts]: Start accepts. Automaton has 8836 states and 12546 transitions. Word has length 25 [2023-12-15 18:10:51,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:51,776 INFO L495 AbstractCegarLoop]: Abstraction has 8836 states and 12546 transitions. [2023-12-15 18:10:51,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 18:10:51,776 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 12546 transitions. [2023-12-15 18:10:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 18:10:51,782 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:51,782 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] [2023-12-15 18:10:51,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-15 18:10:51,783 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:51,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1930216601, now seen corresponding path program 1 times [2023-12-15 18:10:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:51,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052838812] [2023-12-15 18:10:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:51,801 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 18:10:51,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:51,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052838812] [2023-12-15 18:10:51,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052838812] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:51,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:51,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:51,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012907729] [2023-12-15 18:10:51,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:51,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:51,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:51,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:51,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:51,802 INFO L87 Difference]: Start difference. First operand 8836 states and 12546 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 18:10:51,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:51,941 INFO L93 Difference]: Finished difference Result 13256 states and 18756 transitions. [2023-12-15 18:10:51,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:51,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2023-12-15 18:10:51,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:51,954 INFO L225 Difference]: With dead ends: 13256 [2023-12-15 18:10:51,954 INFO L226 Difference]: Without dead ends: 8966 [2023-12-15 18:10:51,959 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 18:10:51,960 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 53 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:51,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 161 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:51,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8966 states. [2023-12-15 18:10:52,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8966 to 8964. [2023-12-15 18:10:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8964 states, 8963 states have (on average 1.3997545464688161) internal successors, (12546), 8963 states have internal predecessors, (12546), 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 18:10:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 12546 transitions. [2023-12-15 18:10:52,138 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 12546 transitions. Word has length 26 [2023-12-15 18:10:52,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:52,138 INFO L495 AbstractCegarLoop]: Abstraction has 8964 states and 12546 transitions. [2023-12-15 18:10:52,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 18:10:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 12546 transitions. [2023-12-15 18:10:52,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 18:10:52,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:52,144 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] [2023-12-15 18:10:52,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-15 18:10:52,144 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:52,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:52,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1343682341, now seen corresponding path program 1 times [2023-12-15 18:10:52,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:52,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604135277] [2023-12-15 18:10:52,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:52,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:52,159 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 18:10:52,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:52,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604135277] [2023-12-15 18:10:52,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604135277] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:52,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:52,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:52,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454191673] [2023-12-15 18:10:52,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:52,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:52,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:52,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:52,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:52,161 INFO L87 Difference]: Start difference. First operand 8964 states and 12546 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 18:10:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:52,321 INFO L93 Difference]: Finished difference Result 15368 states and 21892 transitions. [2023-12-15 18:10:52,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:52,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2023-12-15 18:10:52,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:52,345 INFO L225 Difference]: With dead ends: 15368 [2023-12-15 18:10:52,345 INFO L226 Difference]: Without dead ends: 15366 [2023-12-15 18:10:52,349 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 18:10:52,350 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 34 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:52,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 132 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15366 states. [2023-12-15 18:10:52,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15366 to 13316. [2023-12-15 18:10:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13316 states, 13315 states have (on average 1.3556139692076605) internal successors, (18050), 13315 states have internal predecessors, (18050), 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 18:10:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13316 states to 13316 states and 18050 transitions. [2023-12-15 18:10:52,617 INFO L78 Accepts]: Start accepts. Automaton has 13316 states and 18050 transitions. Word has length 26 [2023-12-15 18:10:52,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:52,617 INFO L495 AbstractCegarLoop]: Abstraction has 13316 states and 18050 transitions. [2023-12-15 18:10:52,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 18:10:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand 13316 states and 18050 transitions. [2023-12-15 18:10:52,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 18:10:52,629 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:52,629 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] [2023-12-15 18:10:52,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-15 18:10:52,629 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:52,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:52,630 INFO L85 PathProgramCache]: Analyzing trace with hash 63818663, now seen corresponding path program 1 times [2023-12-15 18:10:52,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:52,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961862026] [2023-12-15 18:10:52,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:52,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:52,643 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 18:10:52,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:52,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961862026] [2023-12-15 18:10:52,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961862026] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:52,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:52,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:52,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046747949] [2023-12-15 18:10:52,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:52,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:52,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:52,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:52,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:52,644 INFO L87 Difference]: Start difference. First operand 13316 states and 18050 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 18:10:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:52,811 INFO L93 Difference]: Finished difference Result 30472 states and 41348 transitions. [2023-12-15 18:10:52,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:52,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2023-12-15 18:10:52,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:52,837 INFO L225 Difference]: With dead ends: 30472 [2023-12-15 18:10:52,837 INFO L226 Difference]: Without dead ends: 17414 [2023-12-15 18:10:52,852 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 18:10:52,853 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:52,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 176 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:52,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17414 states. [2023-12-15 18:10:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17414 to 17412. [2023-12-15 18:10:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17412 states, 17411 states have (on average 1.33811957957613) internal successors, (23298), 17411 states have internal predecessors, (23298), 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 18:10:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 23298 transitions. [2023-12-15 18:10:53,272 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 23298 transitions. Word has length 26 [2023-12-15 18:10:53,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:53,273 INFO L495 AbstractCegarLoop]: Abstraction has 17412 states and 23298 transitions. [2023-12-15 18:10:53,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 18:10:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 23298 transitions. [2023-12-15 18:10:53,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-15 18:10:53,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:53,284 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] [2023-12-15 18:10:53,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-15 18:10:53,284 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:53,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:53,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1295304961, now seen corresponding path program 1 times [2023-12-15 18:10:53,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:53,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556781380] [2023-12-15 18:10:53,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:53,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:53,297 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 18:10:53,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:53,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556781380] [2023-12-15 18:10:53,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556781380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:53,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:53,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:53,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476468608] [2023-12-15 18:10:53,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:53,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:53,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:53,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:53,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:53,299 INFO L87 Difference]: Start difference. First operand 17412 states and 23298 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 18:10:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:53,505 INFO L93 Difference]: Finished difference Result 26120 states and 34820 transitions. [2023-12-15 18:10:53,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:53,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2023-12-15 18:10:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:53,530 INFO L225 Difference]: With dead ends: 26120 [2023-12-15 18:10:53,530 INFO L226 Difference]: Without dead ends: 17670 [2023-12-15 18:10:53,541 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 18:10:53,541 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:53,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 157 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:53,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17670 states. [2023-12-15 18:10:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17670 to 17668. [2023-12-15 18:10:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17668 states, 17667 states have (on average 1.3187298352861268) internal successors, (23298), 17667 states have internal predecessors, (23298), 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 18:10:53,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17668 states to 17668 states and 23298 transitions. [2023-12-15 18:10:53,893 INFO L78 Accepts]: Start accepts. Automaton has 17668 states and 23298 transitions. Word has length 27 [2023-12-15 18:10:53,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:53,894 INFO L495 AbstractCegarLoop]: Abstraction has 17668 states and 23298 transitions. [2023-12-15 18:10:53,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 18:10:53,894 INFO L276 IsEmpty]: Start isEmpty. Operand 17668 states and 23298 transitions. [2023-12-15 18:10:53,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-15 18:10:53,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:53,904 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] [2023-12-15 18:10:53,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-15 18:10:53,904 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:53,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:53,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1978593981, now seen corresponding path program 1 times [2023-12-15 18:10:53,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:53,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321861944] [2023-12-15 18:10:53,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:53,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:53,916 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 18:10:53,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:53,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321861944] [2023-12-15 18:10:53,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321861944] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:53,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:53,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:53,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372275101] [2023-12-15 18:10:53,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:53,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:53,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:53,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:53,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:53,917 INFO L87 Difference]: Start difference. First operand 17668 states and 23298 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 18:10:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:54,259 INFO L93 Difference]: Finished difference Result 29704 states and 39684 transitions. [2023-12-15 18:10:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:54,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2023-12-15 18:10:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:54,298 INFO L225 Difference]: With dead ends: 29704 [2023-12-15 18:10:54,298 INFO L226 Difference]: Without dead ends: 29702 [2023-12-15 18:10:54,304 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 18:10:54,305 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 31 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:54,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:54,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29702 states. [2023-12-15 18:10:54,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29702 to 26628. [2023-12-15 18:10:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26628 states, 26627 states have (on average 1.278777181056822) internal successors, (34050), 26627 states have internal predecessors, (34050), 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 18:10:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26628 states to 26628 states and 34050 transitions. [2023-12-15 18:10:54,758 INFO L78 Accepts]: Start accepts. Automaton has 26628 states and 34050 transitions. Word has length 27 [2023-12-15 18:10:54,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:54,758 INFO L495 AbstractCegarLoop]: Abstraction has 26628 states and 34050 transitions. [2023-12-15 18:10:54,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 18:10:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 26628 states and 34050 transitions. [2023-12-15 18:10:54,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-15 18:10:54,776 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:54,776 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] [2023-12-15 18:10:54,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-15 18:10:54,776 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:54,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:54,776 INFO L85 PathProgramCache]: Analyzing trace with hash 698730303, now seen corresponding path program 1 times [2023-12-15 18:10:54,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:54,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289566367] [2023-12-15 18:10:54,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:54,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:54,788 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 18:10:54,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:54,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289566367] [2023-12-15 18:10:54,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289566367] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:54,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:54,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:54,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113286039] [2023-12-15 18:10:54,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:54,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:54,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:54,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:54,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:54,789 INFO L87 Difference]: Start difference. First operand 26628 states and 34050 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 18:10:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:55,226 INFO L93 Difference]: Finished difference Result 60424 states and 77060 transitions. [2023-12-15 18:10:55,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:55,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2023-12-15 18:10:55,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:55,261 INFO L225 Difference]: With dead ends: 60424 [2023-12-15 18:10:55,262 INFO L226 Difference]: Without dead ends: 34310 [2023-12-15 18:10:55,281 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 18:10:55,282 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:55,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 177 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34310 states. [2023-12-15 18:10:55,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34310 to 34308. [2023-12-15 18:10:55,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34308 states, 34307 states have (on average 1.2536800069956568) internal successors, (43010), 34307 states have internal predecessors, (43010), 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 18:10:56,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34308 states to 34308 states and 43010 transitions. [2023-12-15 18:10:56,011 INFO L78 Accepts]: Start accepts. Automaton has 34308 states and 43010 transitions. Word has length 27 [2023-12-15 18:10:56,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:56,012 INFO L495 AbstractCegarLoop]: Abstraction has 34308 states and 43010 transitions. [2023-12-15 18:10:56,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 18:10:56,012 INFO L276 IsEmpty]: Start isEmpty. Operand 34308 states and 43010 transitions. [2023-12-15 18:10:56,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-15 18:10:56,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:56,032 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] [2023-12-15 18:10:56,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-15 18:10:56,032 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:56,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:56,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1207087036, now seen corresponding path program 1 times [2023-12-15 18:10:56,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:56,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198041830] [2023-12-15 18:10:56,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:56,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:56,050 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 18:10:56,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:56,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198041830] [2023-12-15 18:10:56,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198041830] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:56,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:56,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:56,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449714063] [2023-12-15 18:10:56,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:56,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:56,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:56,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:56,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:56,052 INFO L87 Difference]: Start difference. First operand 34308 states and 43010 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 18:10:56,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:56,546 INFO L93 Difference]: Finished difference Result 51464 states and 64260 transitions. [2023-12-15 18:10:56,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:56,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2023-12-15 18:10:56,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:56,591 INFO L225 Difference]: With dead ends: 51464 [2023-12-15 18:10:56,591 INFO L226 Difference]: Without dead ends: 34822 [2023-12-15 18:10:56,605 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 18:10:56,606 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 51 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:56,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 153 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:56,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34822 states. [2023-12-15 18:10:57,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34822 to 34820. [2023-12-15 18:10:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34820 states, 34819 states have (on average 1.2352451247881904) internal successors, (43010), 34819 states have internal predecessors, (43010), 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 18:10:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34820 states to 34820 states and 43010 transitions. [2023-12-15 18:10:57,221 INFO L78 Accepts]: Start accepts. Automaton has 34820 states and 43010 transitions. Word has length 28 [2023-12-15 18:10:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:57,221 INFO L495 AbstractCegarLoop]: Abstraction has 34820 states and 43010 transitions. [2023-12-15 18:10:57,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 18:10:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 34820 states and 43010 transitions. [2023-12-15 18:10:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-15 18:10:57,240 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:57,240 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] [2023-12-15 18:10:57,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-15 18:10:57,240 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:57,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:57,241 INFO L85 PathProgramCache]: Analyzing trace with hash 186018682, now seen corresponding path program 1 times [2023-12-15 18:10:57,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:57,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550831134] [2023-12-15 18:10:57,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:57,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:57,252 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 18:10:57,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:57,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550831134] [2023-12-15 18:10:57,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550831134] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:57,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:57,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:57,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157614620] [2023-12-15 18:10:57,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:57,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:57,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:57,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:57,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:57,254 INFO L87 Difference]: Start difference. First operand 34820 states and 43010 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 18:10:58,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:58,072 INFO L93 Difference]: Finished difference Result 101384 states and 122884 transitions. [2023-12-15 18:10:58,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:58,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2023-12-15 18:10:58,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:58,161 INFO L225 Difference]: With dead ends: 101384 [2023-12-15 18:10:58,161 INFO L226 Difference]: Without dead ends: 67590 [2023-12-15 18:10:58,191 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 18:10:58,192 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:58,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 148 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:58,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67590 states. [2023-12-15 18:10:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67590 to 67588. [2023-12-15 18:10:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67588 states, 67587 states have (on average 1.181795315667214) internal successors, (79874), 67587 states have internal predecessors, (79874), 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 18:10:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 79874 transitions. [2023-12-15 18:10:59,584 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 79874 transitions. Word has length 28 [2023-12-15 18:10:59,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:59,585 INFO L495 AbstractCegarLoop]: Abstraction has 67588 states and 79874 transitions. [2023-12-15 18:10:59,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 18:10:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 79874 transitions. [2023-12-15 18:10:59,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-15 18:10:59,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:59,616 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] [2023-12-15 18:10:59,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-15 18:10:59,616 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:59,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1465882360, now seen corresponding path program 1 times [2023-12-15 18:10:59,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:59,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583247316] [2023-12-15 18:10:59,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:59,629 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 18:10:59,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:59,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583247316] [2023-12-15 18:10:59,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583247316] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:59,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:59,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:59,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249744648] [2023-12-15 18:10:59,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:59,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:59,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:59,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:59,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:59,631 INFO L87 Difference]: Start difference. First operand 67588 states and 79874 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 18:11:00,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:11:00,722 INFO L93 Difference]: Finished difference Result 71688 states and 86020 transitions. [2023-12-15 18:11:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:11:00,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2023-12-15 18:11:00,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:11:00,802 INFO L225 Difference]: With dead ends: 71688 [2023-12-15 18:11:00,802 INFO L226 Difference]: Without dead ends: 71686 [2023-12-15 18:11:00,818 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 18:11:00,819 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 28 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:11:00,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:11:00,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71686 states. [2023-12-15 18:11:02,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71686 to 67588. [2023-12-15 18:11:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67588 states, 67587 states have (on average 1.1666444730495509) internal successors, (78850), 67587 states have internal predecessors, (78850), 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 18:11:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 78850 transitions. [2023-12-15 18:11:02,180 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 78850 transitions. Word has length 28 [2023-12-15 18:11:02,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:11:02,181 INFO L495 AbstractCegarLoop]: Abstraction has 67588 states and 78850 transitions. [2023-12-15 18:11:02,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 18:11:02,181 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 78850 transitions. [2023-12-15 18:11:02,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-15 18:11:02,223 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:11:02,223 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] [2023-12-15 18:11:02,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-15 18:11:02,227 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:11:02,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:11:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1471827956, now seen corresponding path program 1 times [2023-12-15 18:11:02,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:11:02,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285992714] [2023-12-15 18:11:02,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:11:02,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:11:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:11:02,272 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 18:11:02,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:11:02,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285992714] [2023-12-15 18:11:02,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285992714] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:11:02,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:11:02,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:11:02,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541195993] [2023-12-15 18:11:02,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:11:02,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:11:02,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:11:02,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:11:02,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:11:02,274 INFO L87 Difference]: Start difference. First operand 67588 states and 78850 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 18:11:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:11:03,569 INFO L93 Difference]: Finished difference Result 109574 states and 126979 transitions. [2023-12-15 18:11:03,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:11:03,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2023-12-15 18:11:03,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:11:03,719 INFO L225 Difference]: With dead ends: 109574 [2023-12-15 18:11:03,719 INFO L226 Difference]: Without dead ends: 109572 [2023-12-15 18:11:03,750 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 18:11:03,750 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 24 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:11:03,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 125 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:11:03,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109572 states. [2023-12-15 18:11:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109572 to 105476. [2023-12-15 18:11:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105476 states, 105475 states have (on average 1.1456174448921546) internal successors, (120834), 105475 states have internal predecessors, (120834), 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 18:11:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105476 states to 105476 states and 120834 transitions. [2023-12-15 18:11:05,597 INFO L78 Accepts]: Start accepts. Automaton has 105476 states and 120834 transitions. Word has length 29 [2023-12-15 18:11:05,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:11:05,597 INFO L495 AbstractCegarLoop]: Abstraction has 105476 states and 120834 transitions. [2023-12-15 18:11:05,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 18:11:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 105476 states and 120834 transitions. [2023-12-15 18:11:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-15 18:11:05,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:11:05,654 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] [2023-12-15 18:11:05,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-15 18:11:05,654 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:11:05,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:11:05,654 INFO L85 PathProgramCache]: Analyzing trace with hash 191964278, now seen corresponding path program 1 times [2023-12-15 18:11:05,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:11:05,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257460678] [2023-12-15 18:11:05,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:11:05,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:11:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:11:05,664 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 18:11:05,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:11:05,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257460678] [2023-12-15 18:11:05,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257460678] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:11:05,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:11:05,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:11:05,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080147057] [2023-12-15 18:11:05,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:11:05,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:11:05,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:11:05,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:11:05,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:11:05,665 INFO L87 Difference]: Start difference. First operand 105476 states and 120834 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 18:11:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:11:07,274 INFO L93 Difference]: Finished difference Result 236548 states and 268290 transitions. [2023-12-15 18:11:07,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:11:07,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2023-12-15 18:11:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:11:07,275 INFO L225 Difference]: With dead ends: 236548 [2023-12-15 18:11:07,275 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 18:11:07,351 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 18:11:07,352 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:11:07,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 177 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:11:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 18:11:07,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 18:11:07,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:11:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 18:11:07,353 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2023-12-15 18:11:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:11:07,353 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 18:11:07,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 18:11:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 18:11:07,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 18:11:07,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 18:11:07,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-15 18:11:07,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 18:11:07,369 INFO L899 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2023-12-15 18:11:07,369 INFO L899 garLoopResultBuilder]: For program point L118-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,370 INFO L899 garLoopResultBuilder]: For program point L168-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,370 INFO L899 garLoopResultBuilder]: For program point L102-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,370 INFO L899 garLoopResultBuilder]: For program point L86-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,370 INFO L899 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2023-12-15 18:11:07,370 INFO L899 garLoopResultBuilder]: For program point L153-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,370 INFO L899 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2023-12-15 18:11:07,370 INFO L899 garLoopResultBuilder]: For program point L138-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,370 INFO L899 garLoopResultBuilder]: For program point L122-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,370 INFO L899 garLoopResultBuilder]: For program point L139(line 139) no Hoare annotation was computed. [2023-12-15 18:11:07,370 INFO L899 garLoopResultBuilder]: For program point L106-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,370 INFO L899 garLoopResultBuilder]: For program point L189(lines 7 193) no Hoare annotation was computed. [2023-12-15 18:11:07,370 INFO L899 garLoopResultBuilder]: For program point L90-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,371 INFO L899 garLoopResultBuilder]: For program point L173-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,371 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 18:11:07,371 INFO L899 garLoopResultBuilder]: For program point L174(line 174) no Hoare annotation was computed. [2023-12-15 18:11:07,371 INFO L899 garLoopResultBuilder]: For program point L158-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,371 INFO L899 garLoopResultBuilder]: For program point L159(line 159) no Hoare annotation was computed. [2023-12-15 18:11:07,371 INFO L899 garLoopResultBuilder]: For program point L143-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,371 INFO L899 garLoopResultBuilder]: For program point L110-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,371 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 6 193) no Hoare annotation was computed. [2023-12-15 18:11:07,371 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,371 INFO L899 garLoopResultBuilder]: For program point L144(line 144) no Hoare annotation was computed. [2023-12-15 18:11:07,371 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 80) no Hoare annotation was computed. [2023-12-15 18:11:07,371 INFO L899 garLoopResultBuilder]: For program point L78-2(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,372 INFO L899 garLoopResultBuilder]: For program point L128-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,372 INFO L899 garLoopResultBuilder]: For program point L178-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 18:11:07,372 INFO L899 garLoopResultBuilder]: For program point L129(line 129) no Hoare annotation was computed. [2023-12-15 18:11:07,372 INFO L899 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2023-12-15 18:11:07,372 INFO L899 garLoopResultBuilder]: For program point L163-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,372 INFO L899 garLoopResultBuilder]: For program point L114-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,372 INFO L899 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2023-12-15 18:11:07,372 INFO L899 garLoopResultBuilder]: For program point L98-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,372 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 191) no Hoare annotation was computed. [2023-12-15 18:11:07,372 INFO L899 garLoopResultBuilder]: For program point L148-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,372 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2023-12-15 18:11:07,373 INFO L899 garLoopResultBuilder]: For program point L82-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,373 INFO L899 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2023-12-15 18:11:07,373 INFO L899 garLoopResultBuilder]: For program point L133-1(lines 47 188) no Hoare annotation was computed. [2023-12-15 18:11:07,373 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 7 193) no Hoare annotation was computed. [2023-12-15 18:11:07,373 INFO L902 garLoopResultBuilder]: At program point L183-1(lines 47 188) the Hoare annotation is: true [2023-12-15 18:11:07,373 INFO L899 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2023-12-15 18:11:07,375 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:11:07,377 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 18:11:07,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 06:11:07 BoogieIcfgContainer [2023-12-15 18:11:07,383 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 18:11:07,383 INFO L158 Benchmark]: Toolchain (without parser) took 19418.16ms. Allocated memory was 252.7MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 210.6MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-12-15 18:11:07,384 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 191.9MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 18:11:07,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.59ms. Allocated memory is still 252.7MB. Free memory was 210.6MB in the beginning and 198.7MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-15 18:11:07,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.42ms. Allocated memory is still 252.7MB. Free memory was 198.7MB in the beginning and 196.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 18:11:07,384 INFO L158 Benchmark]: Boogie Preprocessor took 23.49ms. Allocated memory is still 252.7MB. Free memory was 196.6MB in the beginning and 194.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 18:11:07,384 INFO L158 Benchmark]: RCFGBuilder took 455.77ms. Allocated memory is still 252.7MB. Free memory was 194.5MB in the beginning and 178.8MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-15 18:11:07,384 INFO L158 Benchmark]: TraceAbstraction took 18731.16ms. Allocated memory was 252.7MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 178.1MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-12-15 18:11:07,385 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.36ms. Allocated memory is still 191.9MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.59ms. Allocated memory is still 252.7MB. Free memory was 210.6MB in the beginning and 198.7MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.42ms. Allocated memory is still 252.7MB. Free memory was 198.7MB in the beginning and 196.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.49ms. Allocated memory is still 252.7MB. Free memory was 196.6MB in the beginning and 194.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 455.77ms. Allocated memory is still 252.7MB. Free memory was 194.5MB in the beginning and 178.8MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 18731.16ms. Allocated memory was 252.7MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 178.1MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 191]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.6s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1627 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1627 mSDsluCounter, 5300 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2139 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 212 IncrementalHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 3161 mSDtfsCounter, 212 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105476occurred in iteration=32, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.5s AutomataMinimizationTime, 33 MinimizatonAttempts, 16418 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 4098 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FormulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FormulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 778 NumberOfCodeBlocks, 778 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 745 ConstructedInterpolants, 0 QuantifiedInterpolants, 1669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-12-15 18:11:07,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...