/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 01:13:07,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 01:13:07,940 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-16 01:13:07,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 01:13:07,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 01:13:07,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 01:13:07,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 01:13:07,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 01:13:07,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 01:13:07,966 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 01:13:07,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 01:13:07,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 01:13:07,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 01:13:07,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 01:13:07,967 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 01:13:07,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 01:13:07,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 01:13:07,968 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 01:13:07,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 01:13:07,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 01:13:07,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 01:13:07,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 01:13:07,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 01:13:07,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 01:13:07,972 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 01:13:07,973 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 01:13:07,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 01:13:07,973 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 01:13:07,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 01:13:07,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 01:13:07,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 01:13:07,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 01:13:07,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 01:13:07,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 01:13:07,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 01:13:07,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 01:13:07,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 01:13:07,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 01:13:07,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 01:13:07,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 01:13:07,975 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 01:13:07,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 01:13:07,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 01:13:07,980 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 01:13:08,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 01:13:08,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 01:13:08,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 01:13:08,239 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 01:13:08,239 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 01:13:08,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2023-12-16 01:13:09,394 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 01:13:09,558 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 01:13:09,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2023-12-16 01:13:09,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a511066dc/ab4f18b28bb04fba989bdd6cf76fdcab/FLAGfd7df9efc [2023-12-16 01:13:09,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a511066dc/ab4f18b28bb04fba989bdd6cf76fdcab [2023-12-16 01:13:09,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 01:13:09,578 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 01:13:09,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 01:13:09,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 01:13:09,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 01:13:09,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:13:09" (1/1) ... [2023-12-16 01:13:09,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@108722c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:13:09, skipping insertion in model container [2023-12-16 01:13:09,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:13:09" (1/1) ... [2023-12-16 01:13:09,602 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 01:13:09,712 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_6.c[2544,2557] [2023-12-16 01:13:09,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 01:13:09,724 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 01:13:09,741 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_6.c[2544,2557] [2023-12-16 01:13:09,747 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 01:13:09,755 INFO L206 MainTranslator]: Completed translation [2023-12-16 01:13:09,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:13:09 WrapperNode [2023-12-16 01:13:09,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 01:13:09,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 01:13:09,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 01:13:09,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 01:13:09,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:13:09" (1/1) ... [2023-12-16 01:13:09,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:13:09" (1/1) ... [2023-12-16 01:13:09,797 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 100 [2023-12-16 01:13:09,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 01:13:09,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 01:13:09,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 01:13:09,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 01:13:09,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:13:09" (1/1) ... [2023-12-16 01:13:09,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:13:09" (1/1) ... [2023-12-16 01:13:09,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:13:09" (1/1) ... [2023-12-16 01:13:09,832 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-16 01:13:09,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:13:09" (1/1) ... [2023-12-16 01:13:09,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:13:09" (1/1) ... [2023-12-16 01:13:09,834 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:13:09" (1/1) ... [2023-12-16 01:13:09,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:13:09" (1/1) ... [2023-12-16 01:13:09,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:13:09" (1/1) ... [2023-12-16 01:13:09,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:13:09" (1/1) ... [2023-12-16 01:13:09,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 01:13:09,840 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 01:13:09,840 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 01:13:09,840 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 01:13:09,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:13:09" (1/1) ... [2023-12-16 01:13:09,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 01:13:09,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 01:13:09,873 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-16 01:13:09,899 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-16 01:13:09,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 01:13:09,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 01:13:09,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 01:13:09,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 01:13:09,969 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 01:13:09,970 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 01:13:10,078 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 01:13:10,095 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 01:13:10,095 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 01:13:10,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:13:10 BoogieIcfgContainer [2023-12-16 01:13:10,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 01:13:10,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 01:13:10,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 01:13:10,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 01:13:10,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 01:13:09" (1/3) ... [2023-12-16 01:13:10,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c83220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:13:10, skipping insertion in model container [2023-12-16 01:13:10,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:13:09" (2/3) ... [2023-12-16 01:13:10,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c83220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:13:10, skipping insertion in model container [2023-12-16 01:13:10,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:13:10" (3/3) ... [2023-12-16 01:13:10,111 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2023-12-16 01:13:10,135 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 01:13:10,136 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 01:13:10,170 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 01:13:10,175 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;@310b9925, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 01:13:10,175 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 01:13:10,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 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-16 01:13:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 01:13:10,195 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:13:10,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:13:10,197 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:13:10,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:13:10,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1166319357, now seen corresponding path program 1 times [2023-12-16 01:13:10,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:13:10,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781710328] [2023-12-16 01:13:10,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:13:10,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:13:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:13:10,404 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-16 01:13:10,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:13:10,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781710328] [2023-12-16 01:13:10,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781710328] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:13:10,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:13:10,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:13:10,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126016358] [2023-12-16 01:13:10,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:13:10,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:13:10,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:13:10,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:13:10,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:13:10,438 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 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 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 01:13:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:13:10,502 INFO L93 Difference]: Finished difference Result 54 states and 93 transitions. [2023-12-16 01:13:10,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:13:10,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2023-12-16 01:13:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:13:10,512 INFO L225 Difference]: With dead ends: 54 [2023-12-16 01:13:10,512 INFO L226 Difference]: Without dead ends: 44 [2023-12-16 01:13:10,514 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-16 01:13:10,516 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 30 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 82 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-16 01:13:10,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 82 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:13:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-16 01:13:10,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2023-12-16 01:13:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 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-16 01:13:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 53 transitions. [2023-12-16 01:13:10,538 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 53 transitions. Word has length 12 [2023-12-16 01:13:10,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:13:10,538 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 53 transitions. [2023-12-16 01:13:10,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 01:13:10,539 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 53 transitions. [2023-12-16 01:13:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 01:13:10,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:13:10,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:13:10,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 01:13:10,539 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:13:10,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:13:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash -486260987, now seen corresponding path program 1 times [2023-12-16 01:13:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:13:10,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564564639] [2023-12-16 01:13:10,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:13:10,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:13:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:13:10,572 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-16 01:13:10,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:13:10,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564564639] [2023-12-16 01:13:10,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564564639] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:13:10,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:13:10,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:13:10,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099485175] [2023-12-16 01:13:10,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:13:10,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:13:10,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:13:10,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:13:10,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:13:10,575 INFO L87 Difference]: Start difference. First operand 30 states and 53 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 01:13:10,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:13:10,588 INFO L93 Difference]: Finished difference Result 73 states and 128 transitions. [2023-12-16 01:13:10,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:13:10,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2023-12-16 01:13:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:13:10,589 INFO L225 Difference]: With dead ends: 73 [2023-12-16 01:13:10,589 INFO L226 Difference]: Without dead ends: 44 [2023-12-16 01:13:10,589 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-16 01:13:10,590 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 28 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 84 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-16 01:13:10,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 84 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:13:10,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-16 01:13:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2023-12-16 01:13:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 41 states have internal predecessors, (73), 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-16 01:13:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2023-12-16 01:13:10,595 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 12 [2023-12-16 01:13:10,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:13:10,596 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2023-12-16 01:13:10,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 01:13:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2023-12-16 01:13:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 01:13:10,596 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:13:10,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:13:10,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 01:13:10,597 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:13:10,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:13:10,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1795947055, now seen corresponding path program 1 times [2023-12-16 01:13:10,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:13:10,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660300562] [2023-12-16 01:13:10,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:13:10,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:13:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:13:10,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-16 01:13:10,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:13:10,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660300562] [2023-12-16 01:13:10,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660300562] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:13:10,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:13:10,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:13:10,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49805860] [2023-12-16 01:13:10,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:13:10,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:13:10,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:13:10,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:13:10,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:13:10,631 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-16 01:13:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:13:10,644 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2023-12-16 01:13:10,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:13:10,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2023-12-16 01:13:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:13:10,645 INFO L225 Difference]: With dead ends: 68 [2023-12-16 01:13:10,645 INFO L226 Difference]: Without dead ends: 47 [2023-12-16 01:13:10,646 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-16 01:13:10,646 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 30 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 93 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-16 01:13:10,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 93 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:13:10,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-16 01:13:10,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2023-12-16 01:13:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 44 states have internal predecessors, (75), 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-16 01:13:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions. [2023-12-16 01:13:10,652 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 13 [2023-12-16 01:13:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:13:10,653 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 75 transitions. [2023-12-16 01:13:10,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-16 01:13:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. [2023-12-16 01:13:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 01:13:10,653 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:13:10,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:13:10,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 01:13:10,654 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:13:10,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:13:10,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2105993231, now seen corresponding path program 1 times [2023-12-16 01:13:10,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:13:10,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906922376] [2023-12-16 01:13:10,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:13:10,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:13:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:13:10,688 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-16 01:13:10,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:13:10,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906922376] [2023-12-16 01:13:10,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906922376] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:13:10,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:13:10,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:13:10,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439838473] [2023-12-16 01:13:10,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:13:10,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:13:10,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:13:10,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:13:10,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:13:10,690 INFO L87 Difference]: Start difference. First operand 45 states and 75 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-16 01:13:10,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:13:10,705 INFO L93 Difference]: Finished difference Result 84 states and 140 transitions. [2023-12-16 01:13:10,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:13:10,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2023-12-16 01:13:10,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:13:10,706 INFO L225 Difference]: With dead ends: 84 [2023-12-16 01:13:10,706 INFO L226 Difference]: Without dead ends: 82 [2023-12-16 01:13:10,707 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-16 01:13:10,708 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 25 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 74 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-16 01:13:10,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 74 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:13:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-16 01:13:10,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2023-12-16 01:13:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.694915254237288) internal successors, (100), 59 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 01:13:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 100 transitions. [2023-12-16 01:13:10,716 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 100 transitions. Word has length 13 [2023-12-16 01:13:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:13:10,716 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 100 transitions. [2023-12-16 01:13:10,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-16 01:13:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 100 transitions. [2023-12-16 01:13:10,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 01:13:10,717 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:13:10,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:13:10,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 01:13:10,717 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:13:10,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:13:10,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1508915695, now seen corresponding path program 1 times [2023-12-16 01:13:10,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:13:10,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399396256] [2023-12-16 01:13:10,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:13:10,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:13:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:13:10,750 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-16 01:13:10,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:13:10,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399396256] [2023-12-16 01:13:10,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399396256] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:13:10,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:13:10,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:13:10,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358568386] [2023-12-16 01:13:10,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:13:10,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:13:10,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:13:10,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:13:10,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:13:10,752 INFO L87 Difference]: Start difference. First operand 60 states and 100 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-16 01:13:10,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:13:10,766 INFO L93 Difference]: Finished difference Result 140 states and 234 transitions. [2023-12-16 01:13:10,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:13:10,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2023-12-16 01:13:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:13:10,767 INFO L225 Difference]: With dead ends: 140 [2023-12-16 01:13:10,767 INFO L226 Difference]: Without dead ends: 84 [2023-12-16 01:13:10,767 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-16 01:13:10,768 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 27 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 85 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-16 01:13:10,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 85 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:13:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-16 01:13:10,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2023-12-16 01:13:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.654320987654321) internal successors, (134), 81 states have internal predecessors, (134), 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-16 01:13:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 134 transitions. [2023-12-16 01:13:10,776 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 134 transitions. Word has length 13 [2023-12-16 01:13:10,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:13:10,776 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 134 transitions. [2023-12-16 01:13:10,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-16 01:13:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 134 transitions. [2023-12-16 01:13:10,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 01:13:10,777 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:13:10,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:13:10,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 01:13:10,777 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:13:10,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:13:10,778 INFO L85 PathProgramCache]: Analyzing trace with hash 861495706, now seen corresponding path program 1 times [2023-12-16 01:13:10,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:13:10,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166220107] [2023-12-16 01:13:10,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:13:10,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:13:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:13:10,808 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-16 01:13:10,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:13:10,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166220107] [2023-12-16 01:13:10,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166220107] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:13:10,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:13:10,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:13:10,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505114736] [2023-12-16 01:13:10,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:13:10,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:13:10,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:13:10,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:13:10,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:13:10,810 INFO L87 Difference]: Start difference. First operand 82 states and 134 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 01:13:10,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:13:10,822 INFO L93 Difference]: Finished difference Result 125 states and 201 transitions. [2023-12-16 01:13:10,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:13:10,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2023-12-16 01:13:10,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:13:10,823 INFO L225 Difference]: With dead ends: 125 [2023-12-16 01:13:10,823 INFO L226 Difference]: Without dead ends: 86 [2023-12-16 01:13:10,824 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-16 01:13:10,825 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 29 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 89 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-16 01:13:10,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 89 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:13:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-16 01:13:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2023-12-16 01:13:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.6144578313253013) internal successors, (134), 83 states have internal predecessors, (134), 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-16 01:13:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 134 transitions. [2023-12-16 01:13:10,831 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 134 transitions. Word has length 14 [2023-12-16 01:13:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:13:10,831 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 134 transitions. [2023-12-16 01:13:10,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 01:13:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 134 transitions. [2023-12-16 01:13:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 01:13:10,832 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:13:10,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:13:10,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 01:13:10,833 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:13:10,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:13:10,833 INFO L85 PathProgramCache]: Analyzing trace with hash 468468696, now seen corresponding path program 1 times [2023-12-16 01:13:10,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:13:10,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265736233] [2023-12-16 01:13:10,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:13:10,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:13:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:13:10,872 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-16 01:13:10,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:13:10,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265736233] [2023-12-16 01:13:10,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265736233] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:13:10,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:13:10,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:13:10,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090800362] [2023-12-16 01:13:10,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:13:10,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:13:10,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:13:10,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:13:10,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:13:10,874 INFO L87 Difference]: Start difference. First operand 84 states and 134 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 01:13:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:13:10,890 INFO L93 Difference]: Finished difference Result 236 states and 376 transitions. [2023-12-16 01:13:10,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:13:10,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2023-12-16 01:13:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:13:10,891 INFO L225 Difference]: With dead ends: 236 [2023-12-16 01:13:10,892 INFO L226 Difference]: Without dead ends: 158 [2023-12-16 01:13:10,892 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-16 01:13:10,893 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 27 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 76 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-16 01:13:10,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 76 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:13:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-12-16 01:13:10,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2023-12-16 01:13:10,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.5612903225806452) internal successors, (242), 155 states have internal predecessors, (242), 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-16 01:13:10,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 242 transitions. [2023-12-16 01:13:10,902 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 242 transitions. Word has length 14 [2023-12-16 01:13:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:13:10,903 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 242 transitions. [2023-12-16 01:13:10,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 01:13:10,903 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 242 transitions. [2023-12-16 01:13:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 01:13:10,903 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:13:10,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:13:10,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 01:13:10,904 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:13:10,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:13:10,904 INFO L85 PathProgramCache]: Analyzing trace with hash -211589674, now seen corresponding path program 1 times [2023-12-16 01:13:10,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:13:10,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764641428] [2023-12-16 01:13:10,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:13:10,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:13:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:13:10,927 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-16 01:13:10,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:13:10,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764641428] [2023-12-16 01:13:10,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764641428] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:13:10,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:13:10,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:13:10,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467327566] [2023-12-16 01:13:10,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:13:10,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:13:10,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:13:10,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:13:10,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:13:10,930 INFO L87 Difference]: Start difference. First operand 156 states and 242 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 01:13:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:13:10,946 INFO L93 Difference]: Finished difference Result 192 states and 300 transitions. [2023-12-16 01:13:10,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:13:10,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2023-12-16 01:13:10,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:13:10,947 INFO L225 Difference]: With dead ends: 192 [2023-12-16 01:13:10,947 INFO L226 Difference]: Without dead ends: 190 [2023-12-16 01:13:10,948 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-16 01:13:10,948 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 95 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-16 01:13:10,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:13:10,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-12-16 01:13:10,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 156. [2023-12-16 01:13:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.5354838709677419) internal successors, (238), 155 states have internal predecessors, (238), 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-16 01:13:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 238 transitions. [2023-12-16 01:13:10,958 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 238 transitions. Word has length 14 [2023-12-16 01:13:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:13:10,958 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 238 transitions. [2023-12-16 01:13:10,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 01:13:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 238 transitions. [2023-12-16 01:13:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 01:13:10,959 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:13:10,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:13:10,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 01:13:10,959 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:13:10,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:13:10,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1637843014, now seen corresponding path program 1 times [2023-12-16 01:13:10,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:13:10,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780602155] [2023-12-16 01:13:10,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:13:10,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:13:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:13:10,982 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-16 01:13:10,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:13:10,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780602155] [2023-12-16 01:13:10,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780602155] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:13:10,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:13:10,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:13:10,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176519406] [2023-12-16 01:13:10,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:13:10,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:13:10,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:13:10,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:13:10,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:13:10,984 INFO L87 Difference]: Start difference. First operand 156 states and 238 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-16 01:13:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:13:11,002 INFO L93 Difference]: Finished difference Result 276 states and 424 transitions. [2023-12-16 01:13:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:13:11,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2023-12-16 01:13:11,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:13:11,003 INFO L225 Difference]: With dead ends: 276 [2023-12-16 01:13:11,003 INFO L226 Difference]: Without dead ends: 274 [2023-12-16 01:13:11,004 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-16 01:13:11,005 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 70 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-16 01:13:11,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 70 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:13:11,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-12-16 01:13:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 224. [2023-12-16 01:13:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.4977578475336324) internal successors, (334), 223 states have internal predecessors, (334), 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-16 01:13:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 334 transitions. [2023-12-16 01:13:11,015 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 334 transitions. Word has length 15 [2023-12-16 01:13:11,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:13:11,016 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 334 transitions. [2023-12-16 01:13:11,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-16 01:13:11,016 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 334 transitions. [2023-12-16 01:13:11,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 01:13:11,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:13:11,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:13:11,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 01:13:11,017 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:13:11,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:13:11,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1977065912, now seen corresponding path program 1 times [2023-12-16 01:13:11,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:13:11,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350239709] [2023-12-16 01:13:11,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:13:11,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:13:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:13:11,037 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-16 01:13:11,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:13:11,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350239709] [2023-12-16 01:13:11,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350239709] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:13:11,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:13:11,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:13:11,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795787231] [2023-12-16 01:13:11,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:13:11,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:13:11,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:13:11,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:13:11,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:13:11,040 INFO L87 Difference]: Start difference. First operand 224 states and 334 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-16 01:13:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:13:11,059 INFO L93 Difference]: Finished difference Result 516 states and 768 transitions. [2023-12-16 01:13:11,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:13:11,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2023-12-16 01:13:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:13:11,060 INFO L225 Difference]: With dead ends: 516 [2023-12-16 01:13:11,060 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 01:13:11,061 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-16 01:13:11,062 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 25 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 87 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-16 01:13:11,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:13:11,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 01:13:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2023-12-16 01:13:11,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.4440677966101696) internal successors, (426), 295 states have internal predecessors, (426), 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-16 01:13:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 426 transitions. [2023-12-16 01:13:11,076 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 426 transitions. Word has length 15 [2023-12-16 01:13:11,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:13:11,076 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 426 transitions. [2023-12-16 01:13:11,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-16 01:13:11,076 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 426 transitions. [2023-12-16 01:13:11,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-16 01:13:11,077 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:13:11,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:13:11,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 01:13:11,078 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:13:11,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:13:11,078 INFO L85 PathProgramCache]: Analyzing trace with hash -766258451, now seen corresponding path program 1 times [2023-12-16 01:13:11,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:13:11,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18084686] [2023-12-16 01:13:11,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:13:11,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:13:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:13:11,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-16 01:13:11,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:13:11,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18084686] [2023-12-16 01:13:11,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18084686] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:13:11,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:13:11,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:13:11,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483315036] [2023-12-16 01:13:11,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:13:11,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:13:11,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:13:11,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:13:11,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:13:11,104 INFO L87 Difference]: Start difference. First operand 296 states and 426 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 01:13:11,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:13:11,130 INFO L93 Difference]: Finished difference Result 452 states and 648 transitions. [2023-12-16 01:13:11,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:13:11,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2023-12-16 01:13:11,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:13:11,131 INFO L225 Difference]: With dead ends: 452 [2023-12-16 01:13:11,131 INFO L226 Difference]: Without dead ends: 310 [2023-12-16 01:13:11,132 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-16 01:13:11,133 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 27 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 81 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-16 01:13:11,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 81 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:13:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2023-12-16 01:13:11,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2023-12-16 01:13:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.4136807817589576) internal successors, (434), 307 states have internal predecessors, (434), 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-16 01:13:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 434 transitions. [2023-12-16 01:13:11,144 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 434 transitions. Word has length 16 [2023-12-16 01:13:11,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:13:11,144 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 434 transitions. [2023-12-16 01:13:11,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 01:13:11,144 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 434 transitions. [2023-12-16 01:13:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-16 01:13:11,145 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:13:11,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:13:11,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 01:13:11,145 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:13:11,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:13:11,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1159285461, now seen corresponding path program 1 times [2023-12-16 01:13:11,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:13:11,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922367074] [2023-12-16 01:13:11,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:13:11,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:13:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:13:11,177 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-16 01:13:11,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:13:11,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922367074] [2023-12-16 01:13:11,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922367074] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:13:11,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:13:11,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:13:11,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068984975] [2023-12-16 01:13:11,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:13:11,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:13:11,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:13:11,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:13:11,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:13:11,179 INFO L87 Difference]: Start difference. First operand 308 states and 434 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 01:13:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:13:11,222 INFO L93 Difference]: Finished difference Result 520 states and 732 transitions. [2023-12-16 01:13:11,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:13:11,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2023-12-16 01:13:11,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:13:11,224 INFO L225 Difference]: With dead ends: 520 [2023-12-16 01:13:11,225 INFO L226 Difference]: Without dead ends: 518 [2023-12-16 01:13:11,225 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-16 01:13:11,226 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 16 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 68 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-16 01:13:11,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 68 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:13:11,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2023-12-16 01:13:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 452. [2023-12-16 01:13:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.370288248337029) internal successors, (618), 451 states have internal predecessors, (618), 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-16 01:13:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 618 transitions. [2023-12-16 01:13:11,240 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 618 transitions. Word has length 16 [2023-12-16 01:13:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:13:11,240 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 618 transitions. [2023-12-16 01:13:11,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 01:13:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 618 transitions. [2023-12-16 01:13:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-16 01:13:11,241 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:13:11,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:13:11,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 01:13:11,241 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:13:11,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:13:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash -479227091, now seen corresponding path program 1 times [2023-12-16 01:13:11,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:13:11,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288784272] [2023-12-16 01:13:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:13:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:13:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:13:11,292 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-16 01:13:11,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:13:11,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288784272] [2023-12-16 01:13:11,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288784272] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:13:11,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:13:11,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:13:11,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444891287] [2023-12-16 01:13:11,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:13:11,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:13:11,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:13:11,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:13:11,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:13:11,294 INFO L87 Difference]: Start difference. First operand 452 states and 618 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 01:13:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:13:11,320 INFO L93 Difference]: Finished difference Result 1016 states and 1372 transitions. [2023-12-16 01:13:11,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:13:11,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2023-12-16 01:13:11,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:13:11,322 INFO L225 Difference]: With dead ends: 1016 [2023-12-16 01:13:11,322 INFO L226 Difference]: Without dead ends: 582 [2023-12-16 01:13:11,324 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-16 01:13:11,326 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 24 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 88 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-16 01:13:11,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 88 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:13:11,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2023-12-16 01:13:11,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2023-12-16 01:13:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.302245250431779) internal successors, (754), 579 states have internal predecessors, (754), 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-16 01:13:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 754 transitions. [2023-12-16 01:13:11,349 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 754 transitions. Word has length 16 [2023-12-16 01:13:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:13:11,349 INFO L495 AbstractCegarLoop]: Abstraction has 580 states and 754 transitions. [2023-12-16 01:13:11,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 01:13:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 754 transitions. [2023-12-16 01:13:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 01:13:11,350 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:13:11,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:13:11,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 01:13:11,350 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:13:11,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:13:11,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1577894915, now seen corresponding path program 1 times [2023-12-16 01:13:11,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:13:11,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005870066] [2023-12-16 01:13:11,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:13:11,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:13:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:13:11,390 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-16 01:13:11,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:13:11,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005870066] [2023-12-16 01:13:11,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005870066] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:13:11,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:13:11,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:13:11,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794145908] [2023-12-16 01:13:11,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:13:11,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:13:11,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:13:11,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:13:11,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:13:11,392 INFO L87 Difference]: Start difference. First operand 580 states and 754 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-16 01:13:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:13:11,420 INFO L93 Difference]: Finished difference Result 872 states and 1124 transitions. [2023-12-16 01:13:11,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:13:11,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2023-12-16 01:13:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:13:11,422 INFO L225 Difference]: With dead ends: 872 [2023-12-16 01:13:11,422 INFO L226 Difference]: Without dead ends: 598 [2023-12-16 01:13:11,422 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-16 01:13:11,423 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 77 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-16 01:13:11,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 77 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:13:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2023-12-16 01:13:11,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2023-12-16 01:13:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.2672268907563025) internal successors, (754), 595 states have internal predecessors, (754), 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-16 01:13:11,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 754 transitions. [2023-12-16 01:13:11,444 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 754 transitions. Word has length 17 [2023-12-16 01:13:11,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:13:11,445 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 754 transitions. [2023-12-16 01:13:11,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-16 01:13:11,445 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 754 transitions. [2023-12-16 01:13:11,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 01:13:11,446 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:13:11,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:13:11,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 01:13:11,446 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:13:11,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:13:11,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1970921925, now seen corresponding path program 1 times [2023-12-16 01:13:11,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:13:11,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396036764] [2023-12-16 01:13:11,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:13:11,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:13:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:13:11,488 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-16 01:13:11,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:13:11,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396036764] [2023-12-16 01:13:11,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396036764] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:13:11,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:13:11,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:13:11,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676578371] [2023-12-16 01:13:11,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:13:11,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:13:11,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:13:11,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:13:11,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:13:11,490 INFO L87 Difference]: Start difference. First operand 596 states and 754 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-16 01:13:11,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:13:11,522 INFO L93 Difference]: Finished difference Result 966 states and 1203 transitions. [2023-12-16 01:13:11,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:13:11,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2023-12-16 01:13:11,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:13:11,527 INFO L225 Difference]: With dead ends: 966 [2023-12-16 01:13:11,528 INFO L226 Difference]: Without dead ends: 964 [2023-12-16 01:13:11,530 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-16 01:13:11,530 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 65 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-16 01:13:11,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 65 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:13:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2023-12-16 01:13:11,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 900. [2023-12-16 01:13:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 1.2302558398220245) internal successors, (1106), 899 states have internal predecessors, (1106), 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-16 01:13:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1106 transitions. [2023-12-16 01:13:11,555 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1106 transitions. Word has length 17 [2023-12-16 01:13:11,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:13:11,555 INFO L495 AbstractCegarLoop]: Abstraction has 900 states and 1106 transitions. [2023-12-16 01:13:11,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-16 01:13:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1106 transitions. [2023-12-16 01:13:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 01:13:11,556 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:13:11,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:13:11,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 01:13:11,556 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:13:11,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:13:11,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1290863555, now seen corresponding path program 1 times [2023-12-16 01:13:11,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:13:11,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028213044] [2023-12-16 01:13:11,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:13:11,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:13:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:13:11,583 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-16 01:13:11,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:13:11,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028213044] [2023-12-16 01:13:11,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028213044] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:13:11,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:13:11,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:13:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693226686] [2023-12-16 01:13:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:13:11,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:13:11,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:13:11,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:13:11,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:13:11,585 INFO L87 Difference]: Start difference. First operand 900 states and 1106 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-16 01:13:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:13:11,619 INFO L93 Difference]: Finished difference Result 1988 states and 2386 transitions. [2023-12-16 01:13:11,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:13:11,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2023-12-16 01:13:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:13:11,620 INFO L225 Difference]: With dead ends: 1988 [2023-12-16 01:13:11,620 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 01:13:11,621 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-16 01:13:11,622 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 22 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 87 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-16 01:13:11,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:13:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 01:13:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 01:13:11,623 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-16 01:13:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 01:13:11,623 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2023-12-16 01:13:11,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:13:11,623 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 01:13:11,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-16 01:13:11,624 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 01:13:11,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 01:13:11,626 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 01:13:11,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 01:13:11,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 01:13:11,635 INFO L899 garLoopResultBuilder]: For program point L60-1(lines 29 104) no Hoare annotation was computed. [2023-12-16 01:13:11,635 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-12-16 01:13:11,635 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 29 104) no Hoare annotation was computed. [2023-12-16 01:13:11,635 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 6 109) no Hoare annotation was computed. [2023-12-16 01:13:11,635 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 29 104) no Hoare annotation was computed. [2023-12-16 01:13:11,635 INFO L899 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2023-12-16 01:13:11,635 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 29 104) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point L105(lines 7 109) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 33) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point L64-1(lines 29 104) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point L89-1(lines 29 104) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point L56-1(lines 29 104) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 50) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point L48-2(lines 29 104) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point L74-1(lines 29 104) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L902 garLoopResultBuilder]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 7 109) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 29 104) no Hoare annotation was computed. [2023-12-16 01:13:11,636 INFO L899 garLoopResultBuilder]: For program point L68-1(lines 29 104) no Hoare annotation was computed. [2023-12-16 01:13:11,639 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:13:11,640 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 01:13:11,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 01:13:11 BoogieIcfgContainer [2023-12-16 01:13:11,648 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 01:13:11,648 INFO L158 Benchmark]: Toolchain (without parser) took 2070.10ms. Allocated memory was 182.5MB in the beginning and 240.1MB in the end (delta: 57.7MB). Free memory was 135.5MB in the beginning and 110.6MB in the end (delta: 24.9MB). Peak memory consumption was 83.5MB. Max. memory is 8.0GB. [2023-12-16 01:13:11,648 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 01:13:11,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.59ms. Allocated memory is still 182.5MB. Free memory was 135.3MB in the beginning and 124.2MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 01:13:11,649 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.19ms. Allocated memory is still 182.5MB. Free memory was 124.2MB in the beginning and 122.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 01:13:11,649 INFO L158 Benchmark]: Boogie Preprocessor took 40.75ms. Allocated memory is still 182.5MB. Free memory was 122.7MB in the beginning and 120.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 01:13:11,649 INFO L158 Benchmark]: RCFGBuilder took 255.93ms. Allocated memory is still 182.5MB. Free memory was 120.8MB in the beginning and 108.7MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 01:13:11,649 INFO L158 Benchmark]: TraceAbstraction took 1550.58ms. Allocated memory was 182.5MB in the beginning and 240.1MB in the end (delta: 57.7MB). Free memory was 108.0MB in the beginning and 110.6MB in the end (delta: -2.6MB). Peak memory consumption was 56.2MB. Max. memory is 8.0GB. [2023-12-16 01:13:11,650 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 177.59ms. Allocated memory is still 182.5MB. Free memory was 135.3MB in the beginning and 124.2MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.19ms. Allocated memory is still 182.5MB. Free memory was 124.2MB in the beginning and 122.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.75ms. Allocated memory is still 182.5MB. Free memory was 122.7MB in the beginning and 120.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 255.93ms. Allocated memory is still 182.5MB. Free memory was 120.8MB in the beginning and 108.7MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1550.58ms. Allocated memory was 182.5MB in the beginning and 240.1MB in the end (delta: 57.7MB). Free memory was 108.0MB in the beginning and 110.6MB in the end (delta: -2.6MB). Peak memory consumption was 56.2MB. 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: 107]: 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, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 389 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 1301 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 509 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 792 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=900occurred in iteration=15, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 66 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.4s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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: 29]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-12-16 01:13:11,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...