/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/loop-simple/nested_4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 05:19:46,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 05:19:46,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 05:19:46,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 05:19:46,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 05:19:46,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 05:19:46,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 05:19:46,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 05:19:46,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 05:19:46,442 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 05:19:46,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 05:19:46,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 05:19:46,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 05:19:46,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 05:19:46,444 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 05:19:46,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 05:19:46,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 05:19:46,445 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 05:19:46,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 05:19:46,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 05:19:46,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 05:19:46,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 05:19:46,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 05:19:46,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 05:19:46,446 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 05:19:46,446 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 05:19:46,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 05:19:46,446 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 05:19:46,447 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 05:19:46,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 05:19:46,447 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 05:19:46,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 05:19:46,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 05:19:46,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 05:19:46,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 05:19:46,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 05:19:46,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 05:19:46,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 05:19:46,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 05:19:46,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 05:19:46,448 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 05:19:46,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 05:19:46,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 05:19:46,449 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 05:19:46,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 05:19:46,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 05:19:46,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 05:19:46,626 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 05:19:46,627 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 05:19:46,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_4.c [2023-12-21 05:19:47,620 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 05:19:47,758 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 05:19:47,759 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_4.c [2023-12-21 05:19:47,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86ed17b1e/d4a879dd1a3f44dca87dd555016b256a/FLAG611f8f1c9 [2023-12-21 05:19:47,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86ed17b1e/d4a879dd1a3f44dca87dd555016b256a [2023-12-21 05:19:47,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 05:19:47,791 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 05:19:47,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 05:19:47,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 05:19:47,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 05:19:47,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:19:47" (1/1) ... [2023-12-21 05:19:47,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4daa1a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:19:47, skipping insertion in model container [2023-12-21 05:19:47,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:19:47" (1/1) ... [2023-12-21 05:19:47,813 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 05:19:47,928 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_4.c[841,854] [2023-12-21 05:19:47,931 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 05:19:47,937 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 05:19:47,955 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_4.c[841,854] [2023-12-21 05:19:47,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 05:19:47,964 INFO L206 MainTranslator]: Completed translation [2023-12-21 05:19:47,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:19:47 WrapperNode [2023-12-21 05:19:47,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 05:19:47,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 05:19:47,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 05:19:47,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 05:19:47,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:19:47" (1/1) ... [2023-12-21 05:19:47,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:19:47" (1/1) ... [2023-12-21 05:19:47,986 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2023-12-21 05:19:47,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 05:19:47,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 05:19:47,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 05:19:47,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 05:19:47,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:19:47" (1/1) ... [2023-12-21 05:19:47,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:19:47" (1/1) ... [2023-12-21 05:19:47,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:19:47" (1/1) ... [2023-12-21 05:19:48,000 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-21 05:19:48,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:19:47" (1/1) ... [2023-12-21 05:19:48,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:19:47" (1/1) ... [2023-12-21 05:19:48,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:19:47" (1/1) ... [2023-12-21 05:19:48,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:19:47" (1/1) ... [2023-12-21 05:19:48,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:19:47" (1/1) ... [2023-12-21 05:19:48,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:19:47" (1/1) ... [2023-12-21 05:19:48,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 05:19:48,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 05:19:48,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 05:19:48,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 05:19:48,008 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:19:47" (1/1) ... [2023-12-21 05:19:48,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 05:19:48,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:19:48,040 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 05:19:48,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 05:19:48,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 05:19:48,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 05:19:48,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 05:19:48,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 05:19:48,099 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 05:19:48,101 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 05:19:48,169 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 05:19:48,184 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 05:19:48,184 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-21 05:19:48,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:19:48 BoogieIcfgContainer [2023-12-21 05:19:48,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 05:19:48,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 05:19:48,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 05:19:48,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 05:19:48,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 05:19:47" (1/3) ... [2023-12-21 05:19:48,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4815a3a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:19:48, skipping insertion in model container [2023-12-21 05:19:48,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:19:47" (2/3) ... [2023-12-21 05:19:48,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4815a3a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:19:48, skipping insertion in model container [2023-12-21 05:19:48,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:19:48" (3/3) ... [2023-12-21 05:19:48,189 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_4.c [2023-12-21 05:19:48,200 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 05:19:48,201 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 05:19:48,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 05:19:48,232 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;@69329836, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 05:19:48,232 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 05:19:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:48,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-21 05:19:48,238 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:19:48,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-21 05:19:48,239 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:19:48,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:19:48,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2909715, now seen corresponding path program 1 times [2023-12-21 05:19:48,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:19:48,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847923920] [2023-12-21 05:19:48,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:19:48,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:19:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:19:48,328 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-21 05:19:48,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:19:48,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847923920] [2023-12-21 05:19:48,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847923920] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 05:19:48,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 05:19:48,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 05:19:48,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348178802] [2023-12-21 05:19:48,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 05:19:48,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 05:19:48,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:19:48,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 05:19:48,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 05:19:48,354 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:19:48,377 INFO L93 Difference]: Finished difference Result 25 states and 41 transitions. [2023-12-21 05:19:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 05:19:48,380 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-12-21 05:19:48,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:19:48,384 INFO L225 Difference]: With dead ends: 25 [2023-12-21 05:19:48,384 INFO L226 Difference]: Without dead ends: 11 [2023-12-21 05:19:48,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 05:19:48,388 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 05:19:48,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 05:19:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-21 05:19:48,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-21 05:19:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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-21 05:19:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2023-12-21 05:19:48,406 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 4 [2023-12-21 05:19:48,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:19:48,406 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2023-12-21 05:19:48,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2023-12-21 05:19:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-21 05:19:48,407 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:19:48,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-21 05:19:48,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 05:19:48,407 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:19:48,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:19:48,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2869353, now seen corresponding path program 1 times [2023-12-21 05:19:48,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:19:48,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126859290] [2023-12-21 05:19:48,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:19:48,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:19:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:19:48,450 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-21 05:19:48,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:19:48,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126859290] [2023-12-21 05:19:48,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126859290] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 05:19:48,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 05:19:48,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 05:19:48,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949299994] [2023-12-21 05:19:48,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 05:19:48,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 05:19:48,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:19:48,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 05:19:48,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 05:19:48,453 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:19:48,465 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2023-12-21 05:19:48,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 05:19:48,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-12-21 05:19:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:19:48,466 INFO L225 Difference]: With dead ends: 21 [2023-12-21 05:19:48,466 INFO L226 Difference]: Without dead ends: 18 [2023-12-21 05:19:48,466 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-21 05:19:48,467 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 05:19:48,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 18 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 05:19:48,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-21 05:19:48,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2023-12-21 05:19:48,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-21 05:19:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2023-12-21 05:19:48,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 4 [2023-12-21 05:19:48,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:19:48,471 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2023-12-21 05:19:48,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:48,471 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2023-12-21 05:19:48,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-21 05:19:48,471 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:19:48,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:19:48,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 05:19:48,472 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:19:48,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:19:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash -396485313, now seen corresponding path program 1 times [2023-12-21 05:19:48,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:19:48,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086236437] [2023-12-21 05:19:48,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:19:48,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:19:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:19:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 05:19:48,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:19:48,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086236437] [2023-12-21 05:19:48,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086236437] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 05:19:48,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 05:19:48,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 05:19:48,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713570382] [2023-12-21 05:19:48,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 05:19:48,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 05:19:48,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:19:48,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 05:19:48,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 05:19:48,537 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:19:48,561 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2023-12-21 05:19:48,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 05:19:48,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-12-21 05:19:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:19:48,562 INFO L225 Difference]: With dead ends: 27 [2023-12-21 05:19:48,562 INFO L226 Difference]: Without dead ends: 17 [2023-12-21 05:19:48,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 05:19:48,563 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 05:19:48,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 17 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 05:19:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-21 05:19:48,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2023-12-21 05:19:48,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-21 05:19:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2023-12-21 05:19:48,566 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 7 [2023-12-21 05:19:48,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:19:48,566 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2023-12-21 05:19:48,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:48,566 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2023-12-21 05:19:48,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 05:19:48,567 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:19:48,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:19:48,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 05:19:48,567 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:19:48,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:19:48,568 INFO L85 PathProgramCache]: Analyzing trace with hash -173137555, now seen corresponding path program 1 times [2023-12-21 05:19:48,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:19:48,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131023004] [2023-12-21 05:19:48,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:19:48,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:19:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:19:48,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 05:19:48,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:19:48,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131023004] [2023-12-21 05:19:48,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131023004] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 05:19:48,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 05:19:48,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 05:19:48,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225387487] [2023-12-21 05:19:48,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 05:19:48,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 05:19:48,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:19:48,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 05:19:48,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 05:19:48,628 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:48,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:19:48,657 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2023-12-21 05:19:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 05:19:48,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-12-21 05:19:48,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:19:48,657 INFO L225 Difference]: With dead ends: 27 [2023-12-21 05:19:48,657 INFO L226 Difference]: Without dead ends: 16 [2023-12-21 05:19:48,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 05:19:48,659 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 05:19:48,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 17 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 05:19:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-21 05:19:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2023-12-21 05:19:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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-21 05:19:48,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2023-12-21 05:19:48,661 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 10 [2023-12-21 05:19:48,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:19:48,662 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2023-12-21 05:19:48,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2023-12-21 05:19:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 05:19:48,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:19:48,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:19:48,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 05:19:48,663 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:19:48,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:19:48,663 INFO L85 PathProgramCache]: Analyzing trace with hash 184291291, now seen corresponding path program 1 times [2023-12-21 05:19:48,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:19:48,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013475480] [2023-12-21 05:19:48,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:19:48,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:19:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:19:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 05:19:48,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:19:48,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013475480] [2023-12-21 05:19:48,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013475480] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 05:19:48,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 05:19:48,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 05:19:48,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819901647] [2023-12-21 05:19:48,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 05:19:48,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 05:19:48,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:19:48,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 05:19:48,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 05:19:48,714 INFO L87 Difference]: Start difference. First operand 14 states and 17 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-21 05:19:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:19:48,722 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2023-12-21 05:19:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 05:19:48,723 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-21 05:19:48,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:19:48,723 INFO L225 Difference]: With dead ends: 27 [2023-12-21 05:19:48,723 INFO L226 Difference]: Without dead ends: 15 [2023-12-21 05:19:48,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 05:19:48,724 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 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-21 05:19:48,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 05:19:48,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-21 05:19:48,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-21 05:19:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-21 05:19:48,727 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2023-12-21 05:19:48,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:19:48,727 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-21 05:19:48,727 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-21 05:19:48,728 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-21 05:19:48,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-21 05:19:48,728 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:19:48,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:19:48,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 05:19:48,728 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:19:48,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:19:48,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1567007972, now seen corresponding path program 1 times [2023-12-21 05:19:48,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:19:48,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924322734] [2023-12-21 05:19:48,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:19:48,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:19:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:19:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 05:19:48,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:19:48,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924322734] [2023-12-21 05:19:48,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924322734] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 05:19:48,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801810535] [2023-12-21 05:19:48,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:19:48,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:19:48,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:19:48,763 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:19:48,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 05:19:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:19:48,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 05:19:48,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:19:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 05:19:48,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:19:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 05:19:48,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801810535] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:19:48,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 05:19:48,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-12-21 05:19:48,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265681045] [2023-12-21 05:19:48,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 05:19:48,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 05:19:48,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:19:48,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 05:19:48,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-21 05:19:48,873 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:19:48,895 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2023-12-21 05:19:48,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 05:19:48,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-21 05:19:48,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:19:48,899 INFO L225 Difference]: With dead ends: 31 [2023-12-21 05:19:48,899 INFO L226 Difference]: Without dead ends: 18 [2023-12-21 05:19:48,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-21 05:19:48,900 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 05:19:48,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 05:19:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-21 05:19:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-21 05:19:48,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-12-21 05:19:48,903 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 14 [2023-12-21 05:19:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:19:48,903 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-12-21 05:19:48,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-12-21 05:19:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 05:19:48,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:19:48,904 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:19:48,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 05:19:49,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-21 05:19:49,105 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:19:49,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:19:49,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1382721509, now seen corresponding path program 2 times [2023-12-21 05:19:49,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:19:49,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189454383] [2023-12-21 05:19:49,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:19:49,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:19:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:19:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 05:19:49,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:19:49,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189454383] [2023-12-21 05:19:49,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189454383] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 05:19:49,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218525132] [2023-12-21 05:19:49,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 05:19:49,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:19:49,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:19:49,138 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:19:49,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 05:19:49,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 05:19:49,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 05:19:49,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 05:19:49,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:19:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 05:19:49,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:19:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 05:19:49,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218525132] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:19:49,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 05:19:49,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2023-12-21 05:19:49,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071288935] [2023-12-21 05:19:49,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 05:19:49,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 05:19:49,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:19:49,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 05:19:49,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-21 05:19:49,308 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:19:49,436 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2023-12-21 05:19:49,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 05:19:49,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-21 05:19:49,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:19:49,437 INFO L225 Difference]: With dead ends: 53 [2023-12-21 05:19:49,437 INFO L226 Difference]: Without dead ends: 37 [2023-12-21 05:19:49,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2023-12-21 05:19:49,440 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 05:19:49,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 56 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 05:19:49,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-21 05:19:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2023-12-21 05:19:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-12-21 05:19:49,453 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 17 [2023-12-21 05:19:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:19:49,453 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-12-21 05:19:49,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-12-21 05:19:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 05:19:49,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:19:49,455 INFO L195 NwaCegarLoop]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:19:49,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 05:19:49,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-21 05:19:49,673 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:19:49,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:19:49,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2140739283, now seen corresponding path program 3 times [2023-12-21 05:19:49,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:19:49,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787074429] [2023-12-21 05:19:49,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:19:49,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:19:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:19:49,720 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2023-12-21 05:19:49,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:19:49,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787074429] [2023-12-21 05:19:49,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787074429] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 05:19:49,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761916984] [2023-12-21 05:19:49,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 05:19:49,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:19:49,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:19:49,721 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:19:49,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 05:19:49,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 05:19:49,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 05:19:49,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 05:19:49,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:19:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-12-21 05:19:49,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:19:49,842 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-12-21 05:19:49,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761916984] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:19:49,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 05:19:49,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2023-12-21 05:19:49,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581359273] [2023-12-21 05:19:49,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 05:19:49,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 05:19:49,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:19:49,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 05:19:49,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-21 05:19:49,845 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:49,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:19:49,947 INFO L93 Difference]: Finished difference Result 292 states and 343 transitions. [2023-12-21 05:19:49,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 05:19:49,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-21 05:19:49,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:19:49,951 INFO L225 Difference]: With dead ends: 292 [2023-12-21 05:19:49,951 INFO L226 Difference]: Without dead ends: 265 [2023-12-21 05:19:49,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2023-12-21 05:19:49,954 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 70 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 05:19:49,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 34 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 05:19:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-12-21 05:19:49,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 185. [2023-12-21 05:19:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.1576086956521738) internal successors, (213), 184 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 213 transitions. [2023-12-21 05:19:49,997 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 213 transitions. Word has length 28 [2023-12-21 05:19:49,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:19:49,997 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 213 transitions. [2023-12-21 05:19:49,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:49,997 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 213 transitions. [2023-12-21 05:19:50,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-12-21 05:19:50,006 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:19:50,006 INFO L195 NwaCegarLoop]: trace histogram [96, 16, 16, 16, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1] [2023-12-21 05:19:50,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 05:19:50,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:19:50,211 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:19:50,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:19:50,211 INFO L85 PathProgramCache]: Analyzing trace with hash 614256617, now seen corresponding path program 4 times [2023-12-21 05:19:50,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:19:50,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174813552] [2023-12-21 05:19:50,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:19:50,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:19:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:19:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6722 backedges. 1478 proven. 53 refuted. 0 times theorem prover too weak. 5191 trivial. 0 not checked. [2023-12-21 05:19:50,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:19:50,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174813552] [2023-12-21 05:19:50,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174813552] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 05:19:50,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258279095] [2023-12-21 05:19:50,477 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 05:19:50,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:19:50,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:19:50,479 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:19:50,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-21 05:19:50,578 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 05:19:50,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 05:19:50,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 05:19:50,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:19:50,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6722 backedges. 1478 proven. 53 refuted. 0 times theorem prover too weak. 5191 trivial. 0 not checked. [2023-12-21 05:19:50,639 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:19:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6722 backedges. 1478 proven. 53 refuted. 0 times theorem prover too weak. 5191 trivial. 0 not checked. [2023-12-21 05:19:50,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258279095] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:19:50,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 05:19:50,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-12-21 05:19:50,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493071591] [2023-12-21 05:19:50,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 05:19:50,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 05:19:50,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:19:50,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 05:19:50,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-12-21 05:19:50,683 INFO L87 Difference]: Start difference. First operand 185 states and 213 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:50,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:19:50,744 INFO L93 Difference]: Finished difference Result 636 states and 753 transitions. [2023-12-21 05:19:50,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 05:19:50,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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 184 [2023-12-21 05:19:50,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:19:50,746 INFO L225 Difference]: With dead ends: 636 [2023-12-21 05:19:50,746 INFO L226 Difference]: Without dead ends: 473 [2023-12-21 05:19:50,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-12-21 05:19:50,750 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 05:19:50,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 05:19:50,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-12-21 05:19:50,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2023-12-21 05:19:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 1.1292372881355932) internal successors, (533), 472 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 533 transitions. [2023-12-21 05:19:50,789 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 533 transitions. Word has length 184 [2023-12-21 05:19:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:19:50,789 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 533 transitions. [2023-12-21 05:19:50,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 533 transitions. [2023-12-21 05:19:50,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2023-12-21 05:19:50,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:19:50,793 INFO L195 NwaCegarLoop]: trace histogram [288, 48, 48, 48, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1] [2023-12-21 05:19:50,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-21 05:19:50,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:19:50,999 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:19:50,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:19:51,000 INFO L85 PathProgramCache]: Analyzing trace with hash -983278615, now seen corresponding path program 5 times [2023-12-21 05:19:51,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:19:51,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480417474] [2023-12-21 05:19:51,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:19:51,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:19:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:19:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 59058 backedges. 22231 proven. 1853 refuted. 0 times theorem prover too weak. 34974 trivial. 0 not checked. [2023-12-21 05:19:51,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:19:51,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480417474] [2023-12-21 05:19:51,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480417474] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 05:19:51,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541735768] [2023-12-21 05:19:51,354 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 05:19:51,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:19:51,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:19:51,355 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:19:51,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-21 05:19:51,499 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2023-12-21 05:19:51,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 05:19:51,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 05:19:51,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:19:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 59058 backedges. 37054 proven. 1853 refuted. 0 times theorem prover too weak. 20151 trivial. 0 not checked. [2023-12-21 05:19:51,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:19:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 59058 backedges. 37054 proven. 1853 refuted. 0 times theorem prover too weak. 20151 trivial. 0 not checked. [2023-12-21 05:19:51,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541735768] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:19:51,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 05:19:51,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-12-21 05:19:51,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579662687] [2023-12-21 05:19:51,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 05:19:51,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 05:19:51,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:19:51,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 05:19:51,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-12-21 05:19:51,741 INFO L87 Difference]: Start difference. First operand 473 states and 533 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:19:51,903 INFO L93 Difference]: Finished difference Result 1741 states and 1974 transitions. [2023-12-21 05:19:51,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 05:19:51,903 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 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 472 [2023-12-21 05:19:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:19:51,908 INFO L225 Difference]: With dead ends: 1741 [2023-12-21 05:19:51,908 INFO L226 Difference]: Without dead ends: 1385 [2023-12-21 05:19:51,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 947 GetRequests, 940 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-12-21 05:19:51,910 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 05:19:51,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 36 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 05:19:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2023-12-21 05:19:52,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1385. [2023-12-21 05:19:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1384 states have (on average 1.125) internal successors, (1557), 1384 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1557 transitions. [2023-12-21 05:19:52,041 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1557 transitions. Word has length 472 [2023-12-21 05:19:52,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:19:52,043 INFO L495 AbstractCegarLoop]: Abstraction has 1385 states and 1557 transitions. [2023-12-21 05:19:52,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1557 transitions. [2023-12-21 05:19:52,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1385 [2023-12-21 05:19:52,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:19:52,073 INFO L195 NwaCegarLoop]: trace histogram [864, 144, 144, 144, 24, 24, 24, 4, 4, 4, 1, 1, 1, 1] [2023-12-21 05:19:52,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-21 05:19:52,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-21 05:19:52,280 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:19:52,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:19:52,281 INFO L85 PathProgramCache]: Analyzing trace with hash -69123607, now seen corresponding path program 6 times [2023-12-21 05:19:52,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:19:52,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288494084] [2023-12-21 05:19:52,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:19:52,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:19:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:19:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 532522 backedges. 0 proven. 399910 refuted. 0 times theorem prover too weak. 132612 trivial. 0 not checked. [2023-12-21 05:19:54,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:19:54,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288494084] [2023-12-21 05:19:54,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288494084] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 05:19:54,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734430107] [2023-12-21 05:19:54,196 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 05:19:54,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:19:54,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:19:54,197 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:19:54,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-21 05:19:54,975 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 233 check-sat command(s) [2023-12-21 05:19:54,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 05:19:54,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 2198 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-21 05:19:54,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:19:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 532522 backedges. 199954 proven. 28563 refuted. 0 times theorem prover too weak. 304005 trivial. 0 not checked. [2023-12-21 05:19:56,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:19:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 532522 backedges. 199954 proven. 28563 refuted. 0 times theorem prover too weak. 304005 trivial. 0 not checked. [2023-12-21 05:19:57,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734430107] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:19:57,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 05:19:57,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 25, 25] total 52 [2023-12-21 05:19:57,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115002535] [2023-12-21 05:19:57,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 05:19:57,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-21 05:19:57,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:19:57,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-21 05:19:57,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=2301, Unknown=0, NotChecked=0, Total=2652 [2023-12-21 05:19:57,981 INFO L87 Difference]: Start difference. First operand 1385 states and 1557 transitions. Second operand has 52 states, 52 states have (on average 3.8076923076923075) internal successors, (198), 52 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:19:59,927 INFO L93 Difference]: Finished difference Result 3170 states and 3568 transitions. [2023-12-21 05:19:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2023-12-21 05:19:59,928 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.8076923076923075) internal successors, (198), 52 states have internal predecessors, (198), 0 states have call successors, (0), 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 1384 [2023-12-21 05:19:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:19:59,930 INFO L225 Difference]: With dead ends: 3170 [2023-12-21 05:19:59,930 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 05:19:59,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2877 GetRequests, 2722 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7068 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3926, Invalid=20566, Unknown=0, NotChecked=0, Total=24492 [2023-12-21 05:19:59,939 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 346 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 05:19:59,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 435 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 05:19:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 05:19:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 05:19:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 05:19:59,940 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1384 [2023-12-21 05:19:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:19:59,940 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 05:19:59,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.8076923076923075) internal successors, (198), 52 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:19:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 05:19:59,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 05:19:59,942 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 05:19:59,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-21 05:20:00,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:20:00,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 05:21:13,918 WARN L293 SmtUtils]: Spent 1.23m on a formula simplification. DAG size of input: 1749 DAG size of output: 1559 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-21 05:22:02,514 WARN L293 SmtUtils]: Spent 47.28s on a formula simplification. DAG size of input: 1559 DAG size of output: 50 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-21 05:22:04,193 INFO L899 garLoopResultBuilder]: For program point L31-1(lines 31 33) no Hoare annotation was computed. [2023-12-21 05:22:04,193 INFO L899 garLoopResultBuilder]: For program point L23-2(lines 23 29) no Hoare annotation was computed. [2023-12-21 05:22:04,194 INFO L895 garLoopResultBuilder]: At program point L23-3(lines 23 29) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~a~0#1| 5))) (or (and .cse0 (= 6 |ULTIMATE.start_main_~b~0#1|) (= 6 |ULTIMATE.start_main_~d~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|)) (and .cse0 (= 2 |ULTIMATE.start_main_~b~0#1|)) (and .cse0 (= 5 |ULTIMATE.start_main_~b~0#1|)) (and (= |ULTIMATE.start_main_~b~0#1| 4) .cse0) (and .cse0 (= 3 |ULTIMATE.start_main_~b~0#1|)) (and (= |ULTIMATE.start_main_~b~0#1| 0) .cse0) (and (= |ULTIMATE.start_main_~b~0#1| 1) .cse0))) [2023-12-21 05:22:04,194 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2023-12-21 05:22:04,194 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 32) no Hoare annotation was computed. [2023-12-21 05:22:04,194 INFO L899 garLoopResultBuilder]: For program point L24-2(lines 24 28) no Hoare annotation was computed. [2023-12-21 05:22:04,198 INFO L895 garLoopResultBuilder]: At program point L24-3(lines 24 28) the Hoare annotation is: (let ((.cse1 (= 5 |ULTIMATE.start_main_~b~0#1|)) (.cse0 (<= |ULTIMATE.start_main_~a~0#1| 5))) (or (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1) (and (= |ULTIMATE.start_main_~c~0#1| 1) .cse0 .cse1) (and .cse0 (= 2 |ULTIMATE.start_main_~b~0#1|)) (and .cse0 .cse1 (= |ULTIMATE.start_main_~c~0#1| 4)) (and (= |ULTIMATE.start_main_~b~0#1| 4) .cse0) (and .cse0 (= 3 |ULTIMATE.start_main_~b~0#1|)) (and .cse0 (= 5 |ULTIMATE.start_main_~c~0#1|) .cse1) (and (= |ULTIMATE.start_main_~b~0#1| 0) .cse0) (and .cse0 .cse1 (= 2 |ULTIMATE.start_main_~c~0#1|)) (and .cse0 (= 6 |ULTIMATE.start_main_~d~0#1|) .cse1 (= 6 |ULTIMATE.start_main_~c~0#1|)) (and .cse0 .cse1 (= 3 |ULTIMATE.start_main_~c~0#1|)) (and (= |ULTIMATE.start_main_~b~0#1| 1) .cse0))) [2023-12-21 05:22:04,198 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 05:22:04,198 INFO L895 garLoopResultBuilder]: At program point L25-3(lines 25 27) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~c~0#1| 5)) (.cse1 (<= |ULTIMATE.start_main_~a~0#1| 5)) (.cse3 (= 5 |ULTIMATE.start_main_~c~0#1|)) (.cse2 (= 5 |ULTIMATE.start_main_~b~0#1|))) (or (and .cse0 .cse1 (= 3 |ULTIMATE.start_main_~b~0#1|)) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse1 .cse2) (and .cse0 .cse1 (= 2 |ULTIMATE.start_main_~b~0#1|)) (and (= |ULTIMATE.start_main_~b~0#1| 1) .cse0 .cse1) (and .cse1 .cse3 .cse2 (= |ULTIMATE.start_main_~d~0#1| 0)) (and .cse1 .cse3 .cse2 (= |ULTIMATE.start_main_~d~0#1| 4)) (and (= |ULTIMATE.start_main_~c~0#1| 1) .cse1 .cse2) (and .cse1 .cse3 .cse2 (= 3 |ULTIMATE.start_main_~d~0#1|)) (and (= 5 |ULTIMATE.start_main_~d~0#1|) .cse1 .cse3 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_main_~c~0#1| 4)) (and .cse1 .cse3 .cse2 (= 2 |ULTIMATE.start_main_~d~0#1|)) (and .cse0 (= |ULTIMATE.start_main_~b~0#1| 0) .cse1) (and .cse1 .cse3 (= 6 |ULTIMATE.start_main_~d~0#1|) .cse2) (and .cse1 .cse2 (= 2 |ULTIMATE.start_main_~c~0#1|)) (and .cse1 .cse2 (= 3 |ULTIMATE.start_main_~c~0#1|)) (and .cse0 (= |ULTIMATE.start_main_~b~0#1| 4) .cse1) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse1 .cse3 .cse2))) [2023-12-21 05:22:04,198 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 05:22:04,198 INFO L899 garLoopResultBuilder]: For program point L22-2(lines 22 30) no Hoare annotation was computed. [2023-12-21 05:22:04,198 INFO L895 garLoopResultBuilder]: At program point L22-3(lines 22 30) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~a~0#1| 6) (= 6 |ULTIMATE.start_main_~b~0#1|) (= 6 |ULTIMATE.start_main_~d~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|)) [2023-12-21 05:22:04,199 INFO L899 garLoopResultBuilder]: For program point L22-4(lines 15 35) no Hoare annotation was computed. [2023-12-21 05:22:04,201 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2023-12-21 05:22:04,202 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 05:22:04,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 05:22:04 BoogieIcfgContainer [2023-12-21 05:22:04,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 05:22:04,217 INFO L158 Benchmark]: Toolchain (without parser) took 136426.06ms. Allocated memory was 307.2MB in the beginning and 795.9MB in the end (delta: 488.6MB). Free memory was 263.2MB in the beginning and 453.0MB in the end (delta: -189.8MB). Peak memory consumption was 483.9MB. Max. memory is 8.0GB. [2023-12-21 05:22:04,217 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 228.6MB. Free memory is still 178.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 05:22:04,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.54ms. Allocated memory is still 307.2MB. Free memory was 262.9MB in the beginning and 252.4MB in the end (delta: 10.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-21 05:22:04,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.22ms. Allocated memory is still 307.2MB. Free memory was 252.4MB in the beginning and 251.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 05:22:04,217 INFO L158 Benchmark]: Boogie Preprocessor took 19.73ms. Allocated memory is still 307.2MB. Free memory was 251.0MB in the beginning and 249.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 05:22:04,218 INFO L158 Benchmark]: RCFGBuilder took 177.44ms. Allocated memory is still 307.2MB. Free memory was 249.3MB in the beginning and 238.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 05:22:04,218 INFO L158 Benchmark]: TraceAbstraction took 136030.71ms. Allocated memory was 307.2MB in the beginning and 795.9MB in the end (delta: 488.6MB). Free memory was 238.1MB in the beginning and 453.0MB in the end (delta: -215.0MB). Peak memory consumption was 458.7MB. Max. memory is 8.0GB. [2023-12-21 05:22:04,219 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.08ms. Allocated memory is still 228.6MB. Free memory is still 178.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 174.54ms. Allocated memory is still 307.2MB. Free memory was 262.9MB in the beginning and 252.4MB in the end (delta: 10.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.22ms. Allocated memory is still 307.2MB. Free memory was 252.4MB in the beginning and 251.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.73ms. Allocated memory is still 307.2MB. Free memory was 251.0MB in the beginning and 249.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 177.44ms. Allocated memory is still 307.2MB. Free memory was 249.3MB in the beginning and 238.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 136030.71ms. Allocated memory was 307.2MB in the beginning and 795.9MB in the end (delta: 488.6MB). Free memory was 238.1MB in the beginning and 453.0MB in the end (delta: -215.0MB). Peak memory consumption was 458.7MB. 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: 32]: 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, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 136.0s, OverallIterations: 11, TraceHistogramMax: 864, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 124.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 461 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 461 mSDsluCounter, 704 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 574 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1705 IncrementalHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 130 mSDtfsCounter, 1705 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4356 GetRequests, 4140 SyntacticMatches, 4 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7206 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1385occurred in iteration=10, InterpolantAutomatonStates: 202, 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, 11 MinimizatonAttempts, 100 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 1817 NumberOfFragments, 370 HoareAnnotationTreeSize, 4 FormulaSimplifications, 51588 FormulaSimplificationTreeSizeReduction, 75.1s HoareSimplificationTime, 4 FormulaSimplificationsInter, 21529 FormulaSimplificationTreeSizeReductionInter, 49.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 4236 NumberOfCodeBlocks, 3344 NumberOfCodeBlocksAsserted, 300 NumberOfCheckSat, 6312 ConstructedInterpolants, 0 QuantifiedInterpolants, 16334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3222 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 1332473/1795254 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: 25]: Loop Invariant Derived loop invariant: (((((((((((((((((((c <= 5) && (a <= 5)) && (3 == b)) || (((c == 0) && (a <= 5)) && (5 == b))) || (((c <= 5) && (a <= 5)) && (2 == b))) || (((b == 1) && (c <= 5)) && (a <= 5))) || ((((a <= 5) && (5 == c)) && (5 == b)) && (d == 0))) || ((((a <= 5) && (5 == c)) && (5 == b)) && (d == 4))) || (((c == 1) && (a <= 5)) && (5 == b))) || ((((a <= 5) && (5 == c)) && (5 == b)) && (3 == d))) || ((((5 == d) && (a <= 5)) && (5 == c)) && (5 == b))) || (((a <= 5) && (5 == b)) && (c == 4))) || ((((a <= 5) && (5 == c)) && (5 == b)) && (2 == d))) || (((c <= 5) && (b == 0)) && (a <= 5))) || ((((a <= 5) && (5 == c)) && (6 == d)) && (5 == b))) || (((a <= 5) && (5 == b)) && (2 == c))) || (((a <= 5) && (5 == b)) && (3 == c))) || (((c <= 5) && (b == 4)) && (a <= 5))) || ((((d == 1) && (a <= 5)) && (5 == c)) && (5 == b))) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((((((a <= 5) && (6 == b)) && (6 == d)) && (6 == c)) || ((a <= 5) && (2 == b))) || ((a <= 5) && (5 == b))) || ((b == 4) && (a <= 5))) || ((a <= 5) && (3 == b))) || ((b == 0) && (a <= 5))) || ((b == 1) && (a <= 5))) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((a <= 6) && (6 == b)) && (6 == d)) && (6 == c)) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((((((((((((c == 0) && (a <= 5)) && (5 == b)) || (((c == 1) && (a <= 5)) && (5 == b))) || ((a <= 5) && (2 == b))) || (((a <= 5) && (5 == b)) && (c == 4))) || ((b == 4) && (a <= 5))) || ((a <= 5) && (3 == b))) || (((a <= 5) && (5 == c)) && (5 == b))) || ((b == 0) && (a <= 5))) || (((a <= 5) && (5 == b)) && (2 == c))) || ((((a <= 5) && (6 == d)) && (5 == b)) && (6 == c))) || (((a <= 5) && (5 == b)) && (3 == c))) || ((b == 1) && (a <= 5))) RESULT: Ultimate proved your program to be correct! [2023-12-21 05:22:04,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...