/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-lit/mcmillan2006.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 04:36:29,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 04:36:29,313 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 04:36:29,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 04:36:29,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 04:36:29,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 04:36:29,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 04:36:29,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 04:36:29,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 04:36:29,342 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 04:36:29,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 04:36:29,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 04:36:29,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 04:36:29,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 04:36:29,344 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 04:36:29,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 04:36:29,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 04:36:29,345 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 04:36:29,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 04:36:29,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 04:36:29,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 04:36:29,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 04:36:29,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 04:36:29,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 04:36:29,346 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 04:36:29,346 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 04:36:29,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 04:36:29,346 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 04:36:29,347 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 04:36:29,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 04:36:29,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 04:36:29,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 04:36:29,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 04:36:29,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 04:36:29,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 04:36:29,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 04:36:29,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 04:36:29,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 04:36:29,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 04:36:29,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 04:36:29,349 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 04:36:29,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 04:36:29,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 04:36:29,349 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 04:36:29,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 04:36:29,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 04:36:29,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 04:36:29,559 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 04:36:29,559 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 04:36:29,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/mcmillan2006.i [2023-12-21 04:36:30,526 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 04:36:30,700 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 04:36:30,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i [2023-12-21 04:36:30,705 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b567e896/838b1426fb254c159f8c1b7461e0596b/FLAGdfe76f738 [2023-12-21 04:36:30,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b567e896/838b1426fb254c159f8c1b7461e0596b [2023-12-21 04:36:30,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 04:36:30,718 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 04:36:30,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 04:36:30,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 04:36:30,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 04:36:30,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 04:36:30" (1/1) ... [2023-12-21 04:36:30,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6825566b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:36:30, skipping insertion in model container [2023-12-21 04:36:30,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 04:36:30" (1/1) ... [2023-12-21 04:36:30,738 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 04:36:30,867 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-lit/mcmillan2006.i[1009,1022] [2023-12-21 04:36:30,881 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 04:36:30,890 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 04:36:30,900 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-lit/mcmillan2006.i[1009,1022] [2023-12-21 04:36:30,905 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 04:36:30,915 INFO L206 MainTranslator]: Completed translation [2023-12-21 04:36:30,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:36:30 WrapperNode [2023-12-21 04:36:30,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 04:36:30,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 04:36:30,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 04:36:30,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 04:36:30,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:36:30" (1/1) ... [2023-12-21 04:36:30,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:36:30" (1/1) ... [2023-12-21 04:36:30,939 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2023-12-21 04:36:30,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 04:36:30,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 04:36:30,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 04:36:30,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 04:36:30,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:36:30" (1/1) ... [2023-12-21 04:36:30,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:36:30" (1/1) ... [2023-12-21 04:36:30,954 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:36:30" (1/1) ... [2023-12-21 04:36:30,967 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2023-12-21 04:36:30,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:36:30" (1/1) ... [2023-12-21 04:36:30,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:36:30" (1/1) ... [2023-12-21 04:36:30,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:36:30" (1/1) ... [2023-12-21 04:36:30,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:36:30" (1/1) ... [2023-12-21 04:36:30,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:36:30" (1/1) ... [2023-12-21 04:36:30,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:36:30" (1/1) ... [2023-12-21 04:36:30,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 04:36:30,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 04:36:30,984 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 04:36:30,985 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 04:36:30,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:36:30" (1/1) ... [2023-12-21 04:36:30,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 04:36:30,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:36:31,011 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 04:36:31,027 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 04:36:31,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 04:36:31,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 04:36:31,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 04:36:31,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 04:36:31,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 04:36:31,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 04:36:31,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 04:36:31,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 04:36:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 04:36:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 04:36:31,086 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 04:36:31,089 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 04:36:31,215 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 04:36:31,228 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 04:36:31,228 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-21 04:36:31,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 04:36:31 BoogieIcfgContainer [2023-12-21 04:36:31,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 04:36:31,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 04:36:31,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 04:36:31,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 04:36:31,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 04:36:30" (1/3) ... [2023-12-21 04:36:31,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c74f0fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 04:36:31, skipping insertion in model container [2023-12-21 04:36:31,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:36:30" (2/3) ... [2023-12-21 04:36:31,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c74f0fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 04:36:31, skipping insertion in model container [2023-12-21 04:36:31,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 04:36:31" (3/3) ... [2023-12-21 04:36:31,234 INFO L112 eAbstractionObserver]: Analyzing ICFG mcmillan2006.i [2023-12-21 04:36:31,245 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 04:36:31,246 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 04:36:31,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 04:36:31,294 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;@66b1218d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 04:36:31,294 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 04:36:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 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 04:36:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-21 04:36:31,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:36:31,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:36:31,302 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:36:31,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:36:31,307 INFO L85 PathProgramCache]: Analyzing trace with hash -20536728, now seen corresponding path program 1 times [2023-12-21 04:36:31,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:36:31,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641875888] [2023-12-21 04:36:31,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:36:31,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:36:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:36:31,441 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 04:36:31,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:36:31,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641875888] [2023-12-21 04:36:31,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641875888] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 04:36:31,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 04:36:31,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 04:36:31,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526525874] [2023-12-21 04:36:31,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 04:36:31,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 04:36:31,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:36:31,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 04:36:31,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 04:36:31,472 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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 04:36:31,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:36:31,497 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2023-12-21 04:36:31,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 04:36:31,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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 04:36:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:36:31,506 INFO L225 Difference]: With dead ends: 21 [2023-12-21 04:36:31,506 INFO L226 Difference]: Without dead ends: 9 [2023-12-21 04:36:31,508 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 04:36:31,511 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 04:36:31,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 04:36:31,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-21 04:36:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-12-21 04:36:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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 04:36:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-12-21 04:36:31,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2023-12-21 04:36:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:36:31,549 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-12-21 04:36:31,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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 04:36:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2023-12-21 04:36:31,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-21 04:36:31,550 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:36:31,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:36:31,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 04:36:31,550 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:36:31,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:36:31,551 INFO L85 PathProgramCache]: Analyzing trace with hash -26077854, now seen corresponding path program 1 times [2023-12-21 04:36:31,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:36:31,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112648722] [2023-12-21 04:36:31,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:36:31,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:36:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:36:31,675 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 04:36:31,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:36:31,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112648722] [2023-12-21 04:36:31,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112648722] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 04:36:31,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 04:36:31,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 04:36:31,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186832568] [2023-12-21 04:36:31,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 04:36:31,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 04:36:31,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:36:31,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 04:36:31,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 04:36:31,677 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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 04:36:31,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:36:31,702 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2023-12-21 04:36:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 04:36:31,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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 04:36:31,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:36:31,703 INFO L225 Difference]: With dead ends: 17 [2023-12-21 04:36:31,703 INFO L226 Difference]: Without dead ends: 10 [2023-12-21 04:36:31,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 04:36:31,704 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 04:36:31,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 04:36:31,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-12-21 04:36:31,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-12-21 04:36:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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 04:36:31,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-12-21 04:36:31,709 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 7 [2023-12-21 04:36:31,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:36:31,709 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-12-21 04:36:31,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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 04:36:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-12-21 04:36:31,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-21 04:36:31,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:36:31,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:36:31,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 04:36:31,710 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:36:31,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:36:31,713 INFO L85 PathProgramCache]: Analyzing trace with hash 329123159, now seen corresponding path program 1 times [2023-12-21 04:36:31,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:36:31,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671630165] [2023-12-21 04:36:31,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:36:31,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:36:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:36:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:36:31,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:36:31,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671630165] [2023-12-21 04:36:31,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671630165] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 04:36:31,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126624075] [2023-12-21 04:36:31,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:36:31,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:36:31,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:36:31,942 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 04:36:31,968 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 04:36:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:36:32,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 04:36:32,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 04:36:32,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 04:36:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:36:32,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 04:36:32,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-12-21 04:36:32,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-12-21 04:36:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:36:32,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126624075] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 04:36:32,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 04:36:32,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-12-21 04:36:32,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867173534] [2023-12-21 04:36:32,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 04:36:32,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 04:36:32,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:36:32,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 04:36:32,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-21 04:36:32,163 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 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 04:36:32,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:36:32,231 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2023-12-21 04:36:32,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 04:36:32,231 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-21 04:36:32,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:36:32,232 INFO L225 Difference]: With dead ends: 15 [2023-12-21 04:36:32,232 INFO L226 Difference]: Without dead ends: 13 [2023-12-21 04:36:32,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-12-21 04:36:32,233 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 04:36:32,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 17 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 04:36:32,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-21 04:36:32,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2023-12-21 04:36:32,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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 04:36:32,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2023-12-21 04:36:32,235 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2023-12-21 04:36:32,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:36:32,236 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-12-21 04:36:32,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 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 04:36:32,236 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2023-12-21 04:36:32,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-21 04:36:32,236 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:36:32,236 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:36:32,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 04:36:32,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:36:32,437 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:36:32,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:36:32,438 INFO L85 PathProgramCache]: Analyzing trace with hash -497183843, now seen corresponding path program 1 times [2023-12-21 04:36:32,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:36:32,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802120600] [2023-12-21 04:36:32,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:36:32,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:36:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:36:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:36:32,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:36:32,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802120600] [2023-12-21 04:36:32,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802120600] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 04:36:32,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125085407] [2023-12-21 04:36:32,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:36:32,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:36:32,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:36:32,507 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 04:36:32,520 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 04:36:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:36:32,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 04:36:32,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 04:36:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:36:32,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 04:36:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:36:32,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125085407] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 04:36:32,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 04:36:32,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-12-21 04:36:32,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822035482] [2023-12-21 04:36:32,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 04:36:32,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 04:36:32,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:36:32,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 04:36:32,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-12-21 04:36:32,649 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:36:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:36:32,692 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2023-12-21 04:36:32,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 04:36:32,692 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-21 04:36:32,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:36:32,693 INFO L225 Difference]: With dead ends: 23 [2023-12-21 04:36:32,693 INFO L226 Difference]: Without dead ends: 13 [2023-12-21 04:36:32,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-21 04:36:32,697 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 04:36:32,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 04:36:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-21 04:36:32,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-21 04:36:32,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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 04:36:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-12-21 04:36:32,706 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2023-12-21 04:36:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:36:32,706 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-12-21 04:36:32,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:36:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-12-21 04:36:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 04:36:32,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:36:32,707 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:36:32,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-21 04:36:32,911 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,SelfDestructingSolverStorable3 [2023-12-21 04:36:32,912 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:36:32,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:36:32,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1619623662, now seen corresponding path program 2 times [2023-12-21 04:36:32,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:36:32,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512608343] [2023-12-21 04:36:32,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:36:32,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:36:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:36:33,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:36:33,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:36:33,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512608343] [2023-12-21 04:36:33,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512608343] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 04:36:33,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183617047] [2023-12-21 04:36:33,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 04:36:33,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:36:33,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:36:33,052 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 04:36:33,055 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 04:36:33,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 04:36:33,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 04:36:33,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-21 04:36:33,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 04:36:33,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 04:36:33,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-21 04:36:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:36:33,303 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 04:36:33,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-12-21 04:36:33,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:36:33,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 47 [2023-12-21 04:36:33,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:36:33,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183617047] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 04:36:33,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 04:36:33,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 21 [2023-12-21 04:36:33,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482355732] [2023-12-21 04:36:33,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 04:36:33,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-21 04:36:33,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:36:33,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-21 04:36:33,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2023-12-21 04:36:33,426 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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 04:36:33,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:36:33,532 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2023-12-21 04:36:33,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 04:36:33,532 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-21 04:36:33,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:36:33,533 INFO L225 Difference]: With dead ends: 19 [2023-12-21 04:36:33,533 INFO L226 Difference]: Without dead ends: 17 [2023-12-21 04:36:33,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2023-12-21 04:36:33,533 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 32 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 04:36:33,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 36 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 04:36:33,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-21 04:36:33,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2023-12-21 04:36:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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 04:36:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-12-21 04:36:33,536 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2023-12-21 04:36:33,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:36:33,536 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-12-21 04:36:33,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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 04:36:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2023-12-21 04:36:33,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 04:36:33,536 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:36:33,536 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-21 04:36:33,544 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 04:36:33,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:36:33,744 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:36:33,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:36:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash -540788222, now seen corresponding path program 3 times [2023-12-21 04:36:33,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:36:33,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553108779] [2023-12-21 04:36:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:36:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:36:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:36:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:36:33,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:36:33,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553108779] [2023-12-21 04:36:33,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553108779] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 04:36:33,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486878455] [2023-12-21 04:36:33,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 04:36:33,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:36:33,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:36:33,817 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 04:36:33,819 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 04:36:33,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 04:36:33,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 04:36:33,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 04:36:33,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 04:36:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:36:33,921 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 04:36:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:36:33,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486878455] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 04:36:33,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 04:36:33,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-12-21 04:36:33,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138875564] [2023-12-21 04:36:33,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 04:36:33,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 04:36:33,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:36:33,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 04:36:33,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-12-21 04:36:33,958 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:36:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:36:33,984 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2023-12-21 04:36:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 04:36:33,985 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-21 04:36:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:36:33,985 INFO L225 Difference]: With dead ends: 30 [2023-12-21 04:36:33,985 INFO L226 Difference]: Without dead ends: 17 [2023-12-21 04:36:33,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2023-12-21 04:36:33,986 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 04:36:33,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 04:36:33,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-21 04:36:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-21 04:36:33,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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 04:36:33,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-12-21 04:36:33,988 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2023-12-21 04:36:33,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:36:33,988 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-12-21 04:36:33,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:36:33,988 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-12-21 04:36:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-21 04:36:33,989 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:36:33,989 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-21 04:36:33,993 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 04:36:34,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:36:34,193 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:36:34,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:36:34,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1661953271, now seen corresponding path program 4 times [2023-12-21 04:36:34,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:36:34,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424020132] [2023-12-21 04:36:34,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:36:34,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:36:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:36:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:36:34,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:36:34,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424020132] [2023-12-21 04:36:34,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424020132] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 04:36:34,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524218833] [2023-12-21 04:36:34,316 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 04:36:34,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:36:34,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:36:34,317 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 04:36:34,332 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 04:36:34,367 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 04:36:34,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 04:36:34,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-21 04:36:34,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 04:36:34,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-21 04:36:34,593 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-21 04:36:34,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 23 [2023-12-21 04:36:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:36:34,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 04:36:34,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-12-21 04:36:34,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-12-21 04:36:34,854 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 04:36:34,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524218833] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 04:36:34,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 04:36:34,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 24 [2023-12-21 04:36:34,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832547060] [2023-12-21 04:36:34,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 04:36:34,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 04:36:34,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:36:34,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 04:36:34,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2023-12-21 04:36:34,856 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 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 04:36:35,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:36:35,424 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-12-21 04:36:35,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 04:36:35,425 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 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 16 [2023-12-21 04:36:35,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:36:35,425 INFO L225 Difference]: With dead ends: 31 [2023-12-21 04:36:35,425 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 04:36:35,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=1622, Unknown=0, NotChecked=0, Total=1892 [2023-12-21 04:36:35,426 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 04:36:35,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 32 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 04:36:35,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 04:36:35,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 04:36:35,427 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 04:36:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 04:36:35,427 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2023-12-21 04:36:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:36:35,427 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 04:36:35,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 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 04:36:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 04:36:35,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 04:36:35,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 04:36:35,436 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 04:36:35,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:36:35,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 04:36:35,972 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 04:36:35,973 INFO L895 garLoopResultBuilder]: At program point L31-3(line 31) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse0 (= |ULTIMATE.start_main_~i~1#1| 0)) (.cse9 (<= |ULTIMATE.start_main_~n~0#1| 1)) (.cse8 (<= |ULTIMATE.start_main_~n~0#1| 2)) (.cse2 (+ |ULTIMATE.start_main_~i~1#1| 1)) (.cse3 (= |ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse4 (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (= (select .cse1 (* |v_ULTIMATE.start_main_~i~1#1_31| 4)) 0) (< |v_ULTIMATE.start_main_~i~1#1_31| 2) (< |ULTIMATE.start_main_~n~0#1| (+ |v_ULTIMATE.start_main_~i~1#1_31| 1))))) (.cse5 (= (select .cse1 0) 0)) (.cse6 (= (select .cse1 4) 0)) (.cse7 (= (select .cse1 8) 0))) (or (and .cse0 (<= |ULTIMATE.start_main_~n~0#1| 0)) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (= (select .cse1 (* |v_ULTIMATE.start_main_~i~1#1_31| 4)) 0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse2) (< |ULTIMATE.start_main_~n~0#1| (+ |v_ULTIMATE.start_main_~i~1#1_31| 1)))) .cse3 .cse4 .cse5 .cse6 (= 0 (select .cse1 (* |ULTIMATE.start_main_~i~1#1| 4))) .cse7) (and .cse8 .cse0 .cse3 .cse5 .cse6) (and .cse0 .cse3 .cse5 .cse9) (and .cse3 .cse5 (<= 1 |ULTIMATE.start_main_~i~1#1|) .cse9) (and .cse8 (= |ULTIMATE.start_main_~i~1#1| 1) .cse3 .cse5 .cse6) (and .cse8 (<= 2 |ULTIMATE.start_main_~i~1#1|) .cse3 .cse5 .cse6) (and (< |ULTIMATE.start_main_~n~0#1| .cse2) .cse3 .cse4 .cse5 .cse6 .cse7)))) [2023-12-21 04:36:35,973 INFO L899 garLoopResultBuilder]: For program point L31-4(line 31) no Hoare annotation was computed. [2023-12-21 04:36:35,973 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 21) no Hoare annotation was computed. [2023-12-21 04:36:35,973 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 18 23) no Hoare annotation was computed. [2023-12-21 04:36:35,973 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 04:36:35,973 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 26 33) no Hoare annotation was computed. [2023-12-21 04:36:35,973 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2023-12-21 04:36:35,973 INFO L895 garLoopResultBuilder]: At program point L30-3(line 30) the Hoare annotation is: (let ((.cse3 (select |#memory_int#1| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse0 (= |ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse1 (= (select .cse3 0) 0)) (.cse2 (= (select .cse3 4) 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0) (and (= |ULTIMATE.start_main_~i~0#1| 1) .cse0 .cse1) (and (= 2 |ULTIMATE.start_main_~i~0#1|) .cse0 .cse1 .cse2) (and .cse0 .cse1 (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (= (select .cse3 (* |v_ULTIMATE.start_main_~i~1#1_31| 4)) 0) (< |v_ULTIMATE.start_main_~i~1#1_31| 2) (< |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~1#1_31| 1)))) .cse2 (= (select .cse3 8) 0))))) [2023-12-21 04:36:35,973 INFO L899 garLoopResultBuilder]: For program point L30-4(line 30) no Hoare annotation was computed. [2023-12-21 04:36:35,973 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2023-12-21 04:36:35,974 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-21 04:36:35,976 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2023-12-21 04:36:35,977 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 04:36:35,985 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated [2023-12-21 04:36:35,986 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated [2023-12-21 04:36:35,986 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][4] could not be translated [2023-12-21 04:36:35,986 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated [2023-12-21 04:36:35,986 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~i~1#1_31 : int :: (#memory_int#1[~x~0!base][v_ULTIMATE.start_main_~i~1#1_31 * 4] == 0 || v_ULTIMATE.start_main_~i~1#1_31 < 2) || ~i~0 < v_ULTIMATE.start_main_~i~1#1_31 + 1) could not be translated [2023-12-21 04:36:35,986 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][4] could not be translated [2023-12-21 04:36:35,986 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][8] could not be translated [2023-12-21 04:36:35,987 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~i~1#1_31 : int :: (#memory_int#1[~x~0!base][v_ULTIMATE.start_main_~i~1#1_31 * 4] == 0 || v_ULTIMATE.start_main_~i~1#1_31 < ~i~1 + 1) || ~n~0 < v_ULTIMATE.start_main_~i~1#1_31 + 1) could not be translated [2023-12-21 04:36:35,988 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~i~1#1_31 : int :: (#memory_int#1[~x~0!base][v_ULTIMATE.start_main_~i~1#1_31 * 4] == 0 || v_ULTIMATE.start_main_~i~1#1_31 < 2) || ~n~0 < v_ULTIMATE.start_main_~i~1#1_31 + 1) could not be translated [2023-12-21 04:36:35,988 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated [2023-12-21 04:36:35,988 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][4] could not be translated [2023-12-21 04:36:35,988 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][~i~1 * 4] could not be translated [2023-12-21 04:36:35,988 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][8] could not be translated [2023-12-21 04:36:35,988 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated [2023-12-21 04:36:35,988 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][4] could not be translated [2023-12-21 04:36:35,988 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated [2023-12-21 04:36:35,988 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated [2023-12-21 04:36:35,989 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated [2023-12-21 04:36:35,989 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][4] could not be translated [2023-12-21 04:36:35,989 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated [2023-12-21 04:36:35,989 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][4] could not be translated [2023-12-21 04:36:35,989 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~i~1#1_31 : int :: (#memory_int#1[~x~0!base][v_ULTIMATE.start_main_~i~1#1_31 * 4] == 0 || v_ULTIMATE.start_main_~i~1#1_31 < 2) || ~n~0 < v_ULTIMATE.start_main_~i~1#1_31 + 1) could not be translated [2023-12-21 04:36:35,989 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated [2023-12-21 04:36:35,989 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][4] could not be translated [2023-12-21 04:36:35,989 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][8] could not be translated [2023-12-21 04:36:35,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 04:36:35 BoogieIcfgContainer [2023-12-21 04:36:35,989 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 04:36:35,990 INFO L158 Benchmark]: Toolchain (without parser) took 5271.49ms. Allocated memory is still 317.7MB. Free memory was 274.2MB in the beginning and 140.4MB in the end (delta: 133.7MB). Peak memory consumption was 134.0MB. Max. memory is 8.0GB. [2023-12-21 04:36:35,990 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 211.8MB. Free memory is still 161.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 04:36:35,990 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.42ms. Allocated memory is still 317.7MB. Free memory was 273.9MB in the beginning and 263.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 04:36:35,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.81ms. Allocated memory is still 317.7MB. Free memory was 263.0MB in the beginning and 261.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 04:36:35,990 INFO L158 Benchmark]: Boogie Preprocessor took 43.03ms. Allocated memory is still 317.7MB. Free memory was 261.3MB in the beginning and 259.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 04:36:35,990 INFO L158 Benchmark]: RCFGBuilder took 244.12ms. Allocated memory is still 317.7MB. Free memory was 259.5MB in the beginning and 248.8MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 04:36:35,991 INFO L158 Benchmark]: TraceAbstraction took 4759.61ms. Allocated memory is still 317.7MB. Free memory was 248.2MB in the beginning and 140.4MB in the end (delta: 107.8MB). Peak memory consumption was 108.8MB. Max. memory is 8.0GB. [2023-12-21 04:36:36,004 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 211.8MB. Free memory is still 161.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 196.42ms. Allocated memory is still 317.7MB. Free memory was 273.9MB in the beginning and 263.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.81ms. Allocated memory is still 317.7MB. Free memory was 263.0MB in the beginning and 261.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.03ms. Allocated memory is still 317.7MB. Free memory was 261.3MB in the beginning and 259.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 244.12ms. Allocated memory is still 317.7MB. Free memory was 259.5MB in the beginning and 248.8MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4759.61ms. Allocated memory is still 317.7MB. Free memory was 248.2MB in the beginning and 140.4MB in the end (delta: 107.8MB). Peak memory consumption was 108.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~i~1#1_31 : int :: (#memory_int#1[~x~0!base][v_ULTIMATE.start_main_~i~1#1_31 * 4] == 0 || v_ULTIMATE.start_main_~i~1#1_31 < 2) || ~i~0 < v_ULTIMATE.start_main_~i~1#1_31 + 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~i~1#1_31 : int :: (#memory_int#1[~x~0!base][v_ULTIMATE.start_main_~i~1#1_31 * 4] == 0 || v_ULTIMATE.start_main_~i~1#1_31 < ~i~1 + 1) || ~n~0 < v_ULTIMATE.start_main_~i~1#1_31 + 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~i~1#1_31 : int :: (#memory_int#1[~x~0!base][v_ULTIMATE.start_main_~i~1#1_31 * 4] == 0 || v_ULTIMATE.start_main_~i~1#1_31 < 2) || ~n~0 < v_ULTIMATE.start_main_~i~1#1_31 + 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][~i~1 * 4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~i~1#1_31 : int :: (#memory_int#1[~x~0!base][v_ULTIMATE.start_main_~i~1#1_31 * 4] == 0 || v_ULTIMATE.start_main_~i~1#1_31 < 2) || ~n~0 < v_ULTIMATE.start_main_~i~1#1_31 + 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~x~0!base][8] could not be translated * 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: 20]: 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, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 160 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 462 IncrementalHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 41 mSDtfsCounter, 462 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 77 SyntacticMatches, 11 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=6, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 20 NumberOfFragments, 324 HoareAnnotationTreeSize, 2 FormulaSimplifications, 113 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FormulaSimplificationsInter, 400 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 183 ConstructedInterpolants, 17 QuantifiedInterpolants, 1361 SizeOfPredicates, 39 NumberOfNonLiveVariables, 363 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 30/96 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: 30]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-21 04:36:36,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...