java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/vogal_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:22:20,944 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:22:20,947 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:22:20,959 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:22:20,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:22:20,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:22:20,961 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:22:20,963 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:22:20,965 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:22:20,966 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:22:20,967 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:22:20,967 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:22:20,968 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:22:20,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:22:20,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:22:20,974 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:22:20,975 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:22:20,977 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:22:20,979 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:22:20,981 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:22:20,982 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:22:20,983 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:22:20,985 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:22:20,986 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:22:20,986 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:22:20,987 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:22:20,988 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:22:20,989 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:22:20,990 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:22:20,991 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:22:20,991 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:22:20,992 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:22:20,992 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:22:20,992 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:22:20,993 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:22:20,994 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:22:20,994 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 22:22:21,010 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:22:21,011 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:22:21,012 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:22:21,012 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 22:22:21,012 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 22:22:21,013 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 22:22:21,013 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 22:22:21,013 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:22:21,013 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:22:21,013 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:22:21,014 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:22:21,014 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:22:21,014 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:22:21,014 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:22:21,014 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:22:21,015 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:22:21,015 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:22:21,015 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:22:21,015 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:22:21,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:22:21,016 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:22:21,016 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:22:21,016 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:22:21,016 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 22:22:21,016 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:22:21,017 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:22:21,017 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:22:21,017 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 22:22:21,060 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:22:21,073 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:22:21,076 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:22:21,078 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:22:21,078 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:22:21,079 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/vogal_true-unreach-call.i [2018-10-26 22:22:21,137 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0741fc146/96739973a2184158805b881b3b75f5ab/FLAG4a2313201 [2018-10-26 22:22:21,628 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:22:21,628 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal_true-unreach-call.i [2018-10-26 22:22:21,637 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0741fc146/96739973a2184158805b881b3b75f5ab/FLAG4a2313201 [2018-10-26 22:22:21,657 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0741fc146/96739973a2184158805b881b3b75f5ab [2018-10-26 22:22:21,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:22:21,671 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 22:22:21,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:22:21,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:22:21,680 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:22:21,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:21,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769a0e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21, skipping insertion in model container [2018-10-26 22:22:21,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:21,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:22:21,721 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:22:21,924 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:22:21,929 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:22:21,962 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:22:21,984 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:22:21,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21 WrapperNode [2018-10-26 22:22:21,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:22:21,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:22:21,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:22:21,985 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:22:21,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:22,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:22,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:22:22,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:22:22,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:22:22,037 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:22:22,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:22,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:22,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:22,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:22,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:22,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:22,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:22,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:22:22,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:22:22,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:22:22,076 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:22:22,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:22:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-26 22:22:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:22:22,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:22:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-26 22:22:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-10-26 22:22:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-26 22:22:22,777 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:22:22,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:22:22 BoogieIcfgContainer [2018-10-26 22:22:22,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:22:22,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:22:22,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:22:22,783 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:22:22,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:22:21" (1/3) ... [2018-10-26 22:22:22,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af1acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:22:22, skipping insertion in model container [2018-10-26 22:22:22,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (2/3) ... [2018-10-26 22:22:22,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af1acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:22:22, skipping insertion in model container [2018-10-26 22:22:22,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:22:22" (3/3) ... [2018-10-26 22:22:22,787 INFO L112 eAbstractionObserver]: Analyzing ICFG vogal_true-unreach-call.i [2018-10-26 22:22:22,797 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:22:22,806 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:22:22,824 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:22:22,855 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 22:22:22,855 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:22:22,856 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:22:22,856 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:22:22,856 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:22:22,856 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:22:22,856 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:22:22,856 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:22:22,857 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:22:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-10-26 22:22:22,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 22:22:22,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:22,881 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:22,884 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:22,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:22,890 INFO L82 PathProgramCache]: Analyzing trace with hash 171948516, now seen corresponding path program 1 times [2018-10-26 22:22:22,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:22,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:22,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:22,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:22,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:22:23,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:22:23,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 22:22:23,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 22:22:23,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 22:22:23,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:22:23,077 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 2 states. [2018-10-26 22:22:23,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:23,105 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2018-10-26 22:22:23,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 22:22:23,107 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-10-26 22:22:23,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:23,120 INFO L225 Difference]: With dead ends: 103 [2018-10-26 22:22:23,120 INFO L226 Difference]: Without dead ends: 49 [2018-10-26 22:22:23,124 INFO L605 BasicCegarLoop]: 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 [2018-10-26 22:22:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-26 22:22:23,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-26 22:22:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-26 22:22:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-10-26 22:22:23,169 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 27 [2018-10-26 22:22:23,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:23,169 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-10-26 22:22:23,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 22:22:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-10-26 22:22:23,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-26 22:22:23,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:23,173 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:23,173 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:23,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:23,174 INFO L82 PathProgramCache]: Analyzing trace with hash -268683175, now seen corresponding path program 1 times [2018-10-26 22:22:23,174 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:23,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:23,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:23,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:23,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:22:23,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:22:23,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:22:23,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:22:23,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:22:23,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:22:23,384 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 3 states. [2018-10-26 22:22:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:23,712 INFO L93 Difference]: Finished difference Result 106 states and 125 transitions. [2018-10-26 22:22:23,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:22:23,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-10-26 22:22:23,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:23,715 INFO L225 Difference]: With dead ends: 106 [2018-10-26 22:22:23,715 INFO L226 Difference]: Without dead ends: 76 [2018-10-26 22:22:23,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:22:23,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-26 22:22:23,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 51. [2018-10-26 22:22:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-26 22:22:23,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-10-26 22:22:23,731 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 33 [2018-10-26 22:22:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:23,731 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-10-26 22:22:23,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:22:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-10-26 22:22:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 22:22:23,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:23,733 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:23,733 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:23,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:23,736 INFO L82 PathProgramCache]: Analyzing trace with hash 493161719, now seen corresponding path program 1 times [2018-10-26 22:22:23,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:23,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:23,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:23,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:23,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:22:23,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:23,869 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:22:23,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:23,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 22:22:24,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:22:24,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-10-26 22:22:24,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:22:24,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:22:24,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:22:24,143 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2018-10-26 22:22:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:24,827 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2018-10-26 22:22:24,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 22:22:24,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-10-26 22:22:24,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:24,831 INFO L225 Difference]: With dead ends: 231 [2018-10-26 22:22:24,831 INFO L226 Difference]: Without dead ends: 195 [2018-10-26 22:22:24,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-10-26 22:22:24,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-26 22:22:24,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 74. [2018-10-26 22:22:24,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-26 22:22:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2018-10-26 22:22:24,845 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 36 [2018-10-26 22:22:24,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:24,845 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2018-10-26 22:22:24,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:22:24,846 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2018-10-26 22:22:24,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-26 22:22:24,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:24,848 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:24,848 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:24,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:24,848 INFO L82 PathProgramCache]: Analyzing trace with hash -620855439, now seen corresponding path program 1 times [2018-10-26 22:22:24,849 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:24,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:24,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:24,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:24,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:22:25,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:25,140 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:22:25,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:25,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:22:25,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:22:25,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-10-26 22:22:25,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:22:25,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:22:25,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:22:25,325 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 6 states. [2018-10-26 22:22:26,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:26,393 INFO L93 Difference]: Finished difference Result 257 states and 319 transitions. [2018-10-26 22:22:26,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 22:22:26,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-10-26 22:22:26,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:26,396 INFO L225 Difference]: With dead ends: 257 [2018-10-26 22:22:26,396 INFO L226 Difference]: Without dead ends: 213 [2018-10-26 22:22:26,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-10-26 22:22:26,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-26 22:22:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 112. [2018-10-26 22:22:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-26 22:22:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 129 transitions. [2018-10-26 22:22:26,413 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 129 transitions. Word has length 50 [2018-10-26 22:22:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:26,413 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 129 transitions. [2018-10-26 22:22:26,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:22:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2018-10-26 22:22:26,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-26 22:22:26,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:26,416 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:26,416 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:26,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:26,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1329861818, now seen corresponding path program 1 times [2018-10-26 22:22:26,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:26,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:26,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:26,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:26,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 22:22:26,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:26,650 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:22:26,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:26,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:26,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2018-10-26 22:22:26,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 22:22:26,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:26,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:26,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:26,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 22:22:26,923 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 22:22:26,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:22:26,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-10-26 22:22:26,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 22:22:26,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 22:22:26,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:22:26,956 INFO L87 Difference]: Start difference. First operand 112 states and 129 transitions. Second operand 11 states. [2018-10-26 22:22:27,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:27,628 INFO L93 Difference]: Finished difference Result 428 states and 502 transitions. [2018-10-26 22:22:27,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 22:22:27,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-10-26 22:22:27,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:27,634 INFO L225 Difference]: With dead ends: 428 [2018-10-26 22:22:27,634 INFO L226 Difference]: Without dead ends: 333 [2018-10-26 22:22:27,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-10-26 22:22:27,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-26 22:22:27,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 112. [2018-10-26 22:22:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-26 22:22:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2018-10-26 22:22:27,653 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 57 [2018-10-26 22:22:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:27,654 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2018-10-26 22:22:27,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 22:22:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2018-10-26 22:22:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-26 22:22:27,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:27,659 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:27,659 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:27,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:27,659 INFO L82 PathProgramCache]: Analyzing trace with hash 433473180, now seen corresponding path program 1 times [2018-10-26 22:22:27,660 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:27,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:27,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:27,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:27,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-26 22:22:27,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:27,813 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:22:27,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:27,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:28,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2018-10-26 22:22:28,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-10-26 22:22:28,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:28,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:28,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:28,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-10-26 22:22:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-26 22:22:28,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:22:28,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-10-26 22:22:28,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 22:22:28,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 22:22:28,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-26 22:22:28,093 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand 12 states. [2018-10-26 22:22:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:29,021 INFO L93 Difference]: Finished difference Result 493 states and 580 transitions. [2018-10-26 22:22:29,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 22:22:29,023 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-10-26 22:22:29,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:29,025 INFO L225 Difference]: With dead ends: 493 [2018-10-26 22:22:29,026 INFO L226 Difference]: Without dead ends: 408 [2018-10-26 22:22:29,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-10-26 22:22:29,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-26 22:22:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 118. [2018-10-26 22:22:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-26 22:22:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2018-10-26 22:22:29,046 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 134 transitions. Word has length 62 [2018-10-26 22:22:29,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:29,046 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 134 transitions. [2018-10-26 22:22:29,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 22:22:29,047 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2018-10-26 22:22:29,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-26 22:22:29,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:29,049 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:29,049 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:29,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:29,049 INFO L82 PathProgramCache]: Analyzing trace with hash 734864085, now seen corresponding path program 1 times [2018-10-26 22:22:29,049 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:29,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:29,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:29,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:29,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:29,395 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 22:22:29,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:29,396 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:22:29,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:29,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:29,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-10-26 22:22:29,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:29,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:29,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 22:22:29,720 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:29,721 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:29,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-26 22:22:29,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:29,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:29,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-10-26 22:22:29,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 8 [2018-10-26 22:22:29,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-10-26 22:22:29,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:29,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:29,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:29,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-26 22:22:29,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 16 [2018-10-26 22:22:29,804 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:29,819 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:29,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-10-26 22:22:29,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:29,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:29,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:29,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-10-26 22:22:29,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 23 [2018-10-26 22:22:29,876 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:29,876 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:29,877 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:29,878 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:29,880 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:29,881 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:29,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-10-26 22:22:29,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:29,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:29,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:29,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-10-26 22:22:30,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 30 [2018-10-26 22:22:30,027 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,051 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,083 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,094 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,117 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,144 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,148 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,151 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,152 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,152 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,155 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,156 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,156 INFO L303 Elim1Store]: Index analysis took 154 ms [2018-10-26 22:22:30,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-10-26 22:22:30,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:30,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:30,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:30,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-10-26 22:22:30,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 37 [2018-10-26 22:22:30,269 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,270 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,271 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,272 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,273 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,274 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,275 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,277 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,279 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,280 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,284 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,285 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,286 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,287 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,288 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,289 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,290 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,291 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,295 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,296 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 244 [2018-10-26 22:22:30,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:30,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:30,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:30,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2018-10-26 22:22:30,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 44 [2018-10-26 22:22:30,522 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,531 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,533 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,535 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,537 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,538 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,539 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,540 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,541 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,542 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,543 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,545 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,546 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,547 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,549 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,550 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,551 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,556 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,557 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,558 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,559 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,559 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,561 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,562 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,563 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,565 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,566 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,567 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,569 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,570 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 30 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 363 [2018-10-26 22:22:30,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:30,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:30,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:30,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2018-10-26 22:22:30,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 51 [2018-10-26 22:22:30,874 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,876 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,878 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,880 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,880 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,881 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,882 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,883 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,884 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,885 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,886 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,887 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,888 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,889 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,891 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,892 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,893 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,894 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,896 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,897 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,898 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,899 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,901 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,902 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,903 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,905 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,906 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,908 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,910 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,911 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,912 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,912 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,913 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,915 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,916 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,917 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,919 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,920 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,923 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,925 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,925 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,926 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:30,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 42 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 506 [2018-10-26 22:22:30,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:31,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:31,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:31,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:76, output treesize:72 [2018-10-26 22:22:31,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 75 treesize of output 58 [2018-10-26 22:22:31,236 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,237 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,237 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,238 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,239 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,240 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,242 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,243 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,244 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,276 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,277 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,277 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,278 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,279 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,280 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,281 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,282 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,283 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,284 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,285 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,286 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,288 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,291 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,292 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,293 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,294 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,295 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,296 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,299 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,300 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,301 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,302 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,303 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,304 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,305 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,306 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,308 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,309 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,310 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,311 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,312 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,314 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,315 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,316 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,317 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,318 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,335 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,336 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,337 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,338 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,338 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,339 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,341 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,342 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,343 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,344 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,344 INFO L303 Elim1Store]: Index analysis took 118 ms [2018-10-26 22:22:31,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 56 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 673 [2018-10-26 22:22:31,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:31,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:31,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:31,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:81 [2018-10-26 22:22:31,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 84 treesize of output 65 [2018-10-26 22:22:31,627 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,628 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,665 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,666 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,667 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,667 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,668 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,669 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,670 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,671 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,672 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,673 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,674 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,675 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,676 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,677 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,678 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,679 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,681 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,682 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,683 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,684 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,685 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,686 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,687 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,689 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,690 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,692 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,693 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,694 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,695 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,697 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,698 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,699 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,700 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,736 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,751 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,752 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,753 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,753 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,754 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,755 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,756 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,757 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,758 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,759 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,760 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,762 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,763 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,764 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,765 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,766 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,767 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,768 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,769 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,771 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,772 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,773 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,774 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,775 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,776 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,777 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,778 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,780 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,783 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,784 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,784 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,785 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,787 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:31,787 INFO L303 Elim1Store]: Index analysis took 163 ms [2018-10-26 22:22:31,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 72 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 864 [2018-10-26 22:22:31,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:32,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:32,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:32,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:94, output treesize:90 [2018-10-26 22:22:32,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 93 treesize of output 72 [2018-10-26 22:22:32,411 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,438 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,459 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,484 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,505 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,523 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,524 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,526 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,528 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,530 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,533 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,534 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,534 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,535 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,536 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,536 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,537 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,538 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,539 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,541 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,542 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,543 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,544 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,545 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,546 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,547 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,548 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,550 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,551 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,552 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,553 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,554 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,555 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,556 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,558 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,559 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,560 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,561 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,562 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,563 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,564 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,565 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,567 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,568 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,569 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,570 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,571 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,573 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,574 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,575 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,576 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,578 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,579 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,580 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,581 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,583 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,584 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,585 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,586 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,588 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,589 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,590 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,591 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,592 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,594 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,595 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,596 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,597 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,599 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,600 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,601 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,602 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,604 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,605 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,606 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,607 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,608 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,610 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,611 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,612 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,614 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,615 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,617 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,618 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,619 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,621 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,622 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,623 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,625 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,626 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:32,627 INFO L303 Elim1Store]: Index analysis took 258 ms [2018-10-26 22:22:32,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 90 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 1079 [2018-10-26 22:22:32,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:33,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:33,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:33,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:103, output treesize:99 [2018-10-26 22:22:33,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 102 treesize of output 79 [2018-10-26 22:22:33,236 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,256 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,278 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,304 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,329 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,361 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,382 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,407 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,422 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,423 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,425 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,427 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,429 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,430 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,430 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,431 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,432 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,433 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,434 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,435 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,436 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,437 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,438 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,439 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,440 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,442 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,443 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,444 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,446 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,447 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,448 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,449 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,450 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,451 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,452 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,453 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,454 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,456 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,457 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,458 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,459 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,460 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,461 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,462 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,463 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,464 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,466 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,467 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,468 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,469 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,470 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,471 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,472 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,473 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,475 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,476 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,477 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,478 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,480 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,481 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,482 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,483 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,484 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,486 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,487 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,488 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,489 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,491 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,492 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,493 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,494 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,495 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,497 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,498 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,499 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,500 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,508 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,509 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,510 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,511 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,512 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,512 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,514 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,515 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,516 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,517 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,519 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,520 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,521 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,522 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,523 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,525 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,526 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,527 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,528 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,529 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,531 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,532 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,533 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,534 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,536 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,537 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,538 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,539 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,540 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,542 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,543 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,544 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,545 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,546 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:33,547 INFO L303 Elim1Store]: Index analysis took 347 ms [2018-10-26 22:22:33,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 110 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 1318 [2018-10-26 22:22:33,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:34,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:34,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:34,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:112, output treesize:108 [2018-10-26 22:22:34,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 110 [2018-10-26 22:22:34,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-10-26 22:22:34,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:34,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:34,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:34,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:127, output treesize:111 [2018-10-26 22:22:34,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 110 [2018-10-26 22:22:34,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-10-26 22:22:34,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:34,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:34,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:34,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:119, output treesize:108 [2018-10-26 22:22:34,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 110 [2018-10-26 22:22:34,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-10-26 22:22:34,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:34,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:34,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:34,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:119, output treesize:108 [2018-10-26 22:22:34,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 110 [2018-10-26 22:22:34,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-10-26 22:22:34,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:34,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:34,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:34,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:119, output treesize:108 [2018-10-26 22:22:35,573 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 22:22:35,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:22:35,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 21] total 26 [2018-10-26 22:22:35,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-26 22:22:35,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-26 22:22:35,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=456, Unknown=0, NotChecked=0, Total=650 [2018-10-26 22:22:35,604 INFO L87 Difference]: Start difference. First operand 118 states and 134 transitions. Second operand 26 states. [2018-10-26 22:22:39,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:39,851 INFO L93 Difference]: Finished difference Result 848 states and 993 transitions. [2018-10-26 22:22:39,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-26 22:22:39,852 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 66 [2018-10-26 22:22:39,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:39,855 INFO L225 Difference]: With dead ends: 848 [2018-10-26 22:22:39,855 INFO L226 Difference]: Without dead ends: 760 [2018-10-26 22:22:39,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=798, Invalid=1854, Unknown=0, NotChecked=0, Total=2652 [2018-10-26 22:22:39,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-10-26 22:22:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 156. [2018-10-26 22:22:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-26 22:22:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 178 transitions. [2018-10-26 22:22:39,886 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 178 transitions. Word has length 66 [2018-10-26 22:22:39,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:39,886 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 178 transitions. [2018-10-26 22:22:39,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-26 22:22:39,887 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2018-10-26 22:22:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-26 22:22:39,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:39,889 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:39,889 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:39,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:39,889 INFO L82 PathProgramCache]: Analyzing trace with hash -242068552, now seen corresponding path program 2 times [2018-10-26 22:22:39,889 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:39,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:39,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:39,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:39,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-26 22:22:40,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:40,220 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:22:40,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:22:40,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:22:40,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:22:40,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:40,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2018-10-26 22:22:40,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-10-26 22:22:40,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:40,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:40,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:40,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-10-26 22:22:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-26 22:22:40,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:22:40,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 16 [2018-10-26 22:22:40,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 22:22:40,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 22:22:40,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-10-26 22:22:40,483 INFO L87 Difference]: Start difference. First operand 156 states and 178 transitions. Second operand 16 states. [2018-10-26 22:22:41,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:41,329 INFO L93 Difference]: Finished difference Result 838 states and 989 transitions. [2018-10-26 22:22:41,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 22:22:41,329 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-10-26 22:22:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:41,333 INFO L225 Difference]: With dead ends: 838 [2018-10-26 22:22:41,333 INFO L226 Difference]: Without dead ends: 793 [2018-10-26 22:22:41,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2018-10-26 22:22:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-10-26 22:22:41,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 231. [2018-10-26 22:22:41,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-26 22:22:41,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 266 transitions. [2018-10-26 22:22:41,369 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 266 transitions. Word has length 72 [2018-10-26 22:22:41,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:41,369 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 266 transitions. [2018-10-26 22:22:41,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 22:22:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 266 transitions. [2018-10-26 22:22:41,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 22:22:41,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:41,372 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:41,372 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:41,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:41,372 INFO L82 PathProgramCache]: Analyzing trace with hash -832931461, now seen corresponding path program 1 times [2018-10-26 22:22:41,372 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:41,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:41,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:41,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:22:41,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:42,317 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2018-10-26 22:22:42,912 WARN L179 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 26 [2018-10-26 22:22:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-26 22:22:43,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:43,570 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:22:43,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:43,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:43,951 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:43,964 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:43,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2018-10-26 22:22:43,977 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-10-26 22:22:43,979 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 22:22:43,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-10-26 22:22:43,993 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:43,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:44,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:44,002 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:27, output treesize:4 [2018-10-26 22:22:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-26 22:22:44,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:22:44,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 25 [2018-10-26 22:22:44,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-26 22:22:44,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-26 22:22:44,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2018-10-26 22:22:44,090 INFO L87 Difference]: Start difference. First operand 231 states and 266 transitions. Second operand 25 states. [2018-10-26 22:22:45,543 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-10-26 22:22:47,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:47,656 INFO L93 Difference]: Finished difference Result 755 states and 887 transitions. [2018-10-26 22:22:47,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-26 22:22:47,658 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 86 [2018-10-26 22:22:47,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:47,662 INFO L225 Difference]: With dead ends: 755 [2018-10-26 22:22:47,662 INFO L226 Difference]: Without dead ends: 720 [2018-10-26 22:22:47,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=376, Invalid=1516, Unknown=0, NotChecked=0, Total=1892 [2018-10-26 22:22:47,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-10-26 22:22:47,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 462. [2018-10-26 22:22:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-10-26 22:22:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 531 transitions. [2018-10-26 22:22:47,734 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 531 transitions. Word has length 86 [2018-10-26 22:22:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:47,734 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 531 transitions. [2018-10-26 22:22:47,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-26 22:22:47,735 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 531 transitions. [2018-10-26 22:22:47,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 22:22:47,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:47,737 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:47,737 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:47,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:47,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1598928319, now seen corresponding path program 1 times [2018-10-26 22:22:47,737 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:47,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:47,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:47,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:47,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-26 22:22:48,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:48,389 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:22:48,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:48,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 22:22:48,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:22:48,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2018-10-26 22:22:48,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 22:22:48,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 22:22:48,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:22:48,791 INFO L87 Difference]: Start difference. First operand 462 states and 531 transitions. Second operand 9 states. [2018-10-26 22:22:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:49,255 INFO L93 Difference]: Finished difference Result 891 states and 1035 transitions. [2018-10-26 22:22:49,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 22:22:49,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-10-26 22:22:49,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:49,259 INFO L225 Difference]: With dead ends: 891 [2018-10-26 22:22:49,259 INFO L226 Difference]: Without dead ends: 887 [2018-10-26 22:22:49,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-10-26 22:22:49,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-10-26 22:22:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 664. [2018-10-26 22:22:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-10-26 22:22:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 765 transitions. [2018-10-26 22:22:49,382 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 765 transitions. Word has length 86 [2018-10-26 22:22:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:49,382 INFO L481 AbstractCegarLoop]: Abstraction has 664 states and 765 transitions. [2018-10-26 22:22:49,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 22:22:49,382 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 765 transitions. [2018-10-26 22:22:49,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 22:22:49,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:49,385 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:49,385 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:49,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:49,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1994974399, now seen corresponding path program 1 times [2018-10-26 22:22:49,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:49,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:49,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:49,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:49,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:50,139 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 10 [2018-10-26 22:22:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-26 22:22:51,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:51,035 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:22:51,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:51,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:51,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 28 [2018-10-26 22:22:51,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-10-26 22:22:51,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:51,312 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:51,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 22:22:51,314 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:51,331 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:51,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-10-26 22:22:51,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:51,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:51,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:51,356 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2018-10-26 22:22:51,388 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-26 22:22:51,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:22:51,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 21 [2018-10-26 22:22:51,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-26 22:22:51,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-26 22:22:51,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-10-26 22:22:51,414 INFO L87 Difference]: Start difference. First operand 664 states and 765 transitions. Second operand 21 states. [2018-10-26 22:22:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:52,682 INFO L93 Difference]: Finished difference Result 952 states and 1112 transitions. [2018-10-26 22:22:52,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 22:22:52,682 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 86 [2018-10-26 22:22:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:52,685 INFO L225 Difference]: With dead ends: 952 [2018-10-26 22:22:52,685 INFO L226 Difference]: Without dead ends: 868 [2018-10-26 22:22:52,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 12 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2018-10-26 22:22:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2018-10-26 22:22:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 693. [2018-10-26 22:22:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2018-10-26 22:22:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 795 transitions. [2018-10-26 22:22:52,812 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 795 transitions. Word has length 86 [2018-10-26 22:22:52,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:52,812 INFO L481 AbstractCegarLoop]: Abstraction has 693 states and 795 transitions. [2018-10-26 22:22:52,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-26 22:22:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 795 transitions. [2018-10-26 22:22:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 22:22:52,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:52,814 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:52,814 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:52,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:52,815 INFO L82 PathProgramCache]: Analyzing trace with hash -690855487, now seen corresponding path program 2 times [2018-10-26 22:22:52,815 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:52,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:52,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:52,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:52,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-26 22:22:53,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:53,961 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:22:53,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:22:54,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:22:54,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:22:54,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:54,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 26 [2018-10-26 22:22:54,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 22:22:54,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:54,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:54,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:54,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-10-26 22:22:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-26 22:22:54,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:22:54,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2018-10-26 22:22:54,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 22:22:54,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 22:22:54,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-10-26 22:22:54,366 INFO L87 Difference]: Start difference. First operand 693 states and 795 transitions. Second operand 17 states. [2018-10-26 22:22:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:54,952 INFO L93 Difference]: Finished difference Result 996 states and 1150 transitions. [2018-10-26 22:22:54,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 22:22:54,953 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2018-10-26 22:22:54,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:54,956 INFO L225 Difference]: With dead ends: 996 [2018-10-26 22:22:54,956 INFO L226 Difference]: Without dead ends: 876 [2018-10-26 22:22:54,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 80 SyntacticMatches, 12 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-10-26 22:22:54,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2018-10-26 22:22:55,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 693. [2018-10-26 22:22:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2018-10-26 22:22:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 789 transitions. [2018-10-26 22:22:55,077 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 789 transitions. Word has length 86 [2018-10-26 22:22:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:55,078 INFO L481 AbstractCegarLoop]: Abstraction has 693 states and 789 transitions. [2018-10-26 22:22:55,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 22:22:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 789 transitions. [2018-10-26 22:22:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 22:22:55,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:55,080 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:55,080 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:55,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:55,081 INFO L82 PathProgramCache]: Analyzing trace with hash -78331777, now seen corresponding path program 1 times [2018-10-26 22:22:55,081 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:55,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:55,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:55,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:22:55,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:55,500 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-26 22:22:55,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:55,500 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:22:55,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:55,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 22:22:55,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:22:55,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 13 [2018-10-26 22:22:55,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 22:22:55,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 22:22:55,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:22:55,640 INFO L87 Difference]: Start difference. First operand 693 states and 789 transitions. Second operand 13 states. [2018-10-26 22:22:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:57,045 INFO L93 Difference]: Finished difference Result 1765 states and 2050 transitions. [2018-10-26 22:22:57,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-26 22:22:57,045 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2018-10-26 22:22:57,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:57,050 INFO L225 Difference]: With dead ends: 1765 [2018-10-26 22:22:57,050 INFO L226 Difference]: Without dead ends: 1759 [2018-10-26 22:22:57,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260 [2018-10-26 22:22:57,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2018-10-26 22:22:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 957. [2018-10-26 22:22:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2018-10-26 22:22:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1091 transitions. [2018-10-26 22:22:57,186 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1091 transitions. Word has length 86 [2018-10-26 22:22:57,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:57,187 INFO L481 AbstractCegarLoop]: Abstraction has 957 states and 1091 transitions. [2018-10-26 22:22:57,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 22:22:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1091 transitions. [2018-10-26 22:22:57,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-26 22:22:57,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:57,189 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:57,189 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:57,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:57,189 INFO L82 PathProgramCache]: Analyzing trace with hash -158863787, now seen corresponding path program 1 times [2018-10-26 22:22:57,189 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:57,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:57,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:57,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:57,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-26 22:22:57,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:57,313 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:22:57,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:57,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 22:22:57,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:22:57,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 7 [2018-10-26 22:22:57,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:22:57,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:22:57,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:22:57,418 INFO L87 Difference]: Start difference. First operand 957 states and 1091 transitions. Second operand 7 states. [2018-10-26 22:22:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:57,821 INFO L93 Difference]: Finished difference Result 1720 states and 1974 transitions. [2018-10-26 22:22:57,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 22:22:57,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-10-26 22:22:57,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:57,835 INFO L225 Difference]: With dead ends: 1720 [2018-10-26 22:22:57,835 INFO L226 Difference]: Without dead ends: 888 [2018-10-26 22:22:57,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:22:57,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-10-26 22:22:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 630. [2018-10-26 22:22:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-10-26 22:22:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 694 transitions. [2018-10-26 22:22:57,941 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 694 transitions. Word has length 92 [2018-10-26 22:22:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:57,941 INFO L481 AbstractCegarLoop]: Abstraction has 630 states and 694 transitions. [2018-10-26 22:22:57,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:22:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 694 transitions. [2018-10-26 22:22:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-26 22:22:57,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:57,943 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:57,944 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:57,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:57,944 INFO L82 PathProgramCache]: Analyzing trace with hash 2072580793, now seen corresponding path program 3 times [2018-10-26 22:22:57,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:57,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:57,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:57,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:57,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-10-26 22:22:58,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:58,830 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:22:58,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:22:59,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-26 22:22:59,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:22:59,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:59,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 13 [2018-10-26 22:22:59,259 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:59,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-10-26 22:22:59,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:59,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:59,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:22:59,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2018-10-26 22:22:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-26 22:22:59,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:22:59,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-10-26 22:22:59,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 22:22:59,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 22:22:59,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-10-26 22:22:59,319 INFO L87 Difference]: Start difference. First operand 630 states and 694 transitions. Second operand 17 states. [2018-10-26 22:23:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:23:01,206 INFO L93 Difference]: Finished difference Result 2735 states and 3004 transitions. [2018-10-26 22:23:01,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-26 22:23:01,206 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-10-26 22:23:01,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:23:01,213 INFO L225 Difference]: With dead ends: 2735 [2018-10-26 22:23:01,213 INFO L226 Difference]: Without dead ends: 2663 [2018-10-26 22:23:01,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=210, Invalid=1430, Unknown=0, NotChecked=0, Total=1640 [2018-10-26 22:23:01,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2018-10-26 22:23:01,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 609. [2018-10-26 22:23:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-10-26 22:23:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 669 transitions. [2018-10-26 22:23:01,345 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 669 transitions. Word has length 96 [2018-10-26 22:23:01,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:23:01,346 INFO L481 AbstractCegarLoop]: Abstraction has 609 states and 669 transitions. [2018-10-26 22:23:01,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 22:23:01,346 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 669 transitions. [2018-10-26 22:23:01,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-26 22:23:01,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:23:01,347 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:23:01,348 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:23:01,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:23:01,348 INFO L82 PathProgramCache]: Analyzing trace with hash 297096864, now seen corresponding path program 2 times [2018-10-26 22:23:01,348 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:23:01,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:23:01,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:23:01,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:23:01,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:23:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:23:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-26 22:23:01,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:23:01,802 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:23:01,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:23:01,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:23:01,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:23:01,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:23:02,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 13 [2018-10-26 22:23:02,012 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:23:02,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-26 22:23:02,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:23:02,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:23:02,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:23:02,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2018-10-26 22:23:02,042 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 41 proven. 20 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-10-26 22:23:02,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:23:02,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-10-26 22:23:02,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 22:23:02,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 22:23:02,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-10-26 22:23:02,064 INFO L87 Difference]: Start difference. First operand 609 states and 669 transitions. Second operand 14 states. [2018-10-26 22:23:02,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:23:02,555 INFO L93 Difference]: Finished difference Result 724 states and 788 transitions. [2018-10-26 22:23:02,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 22:23:02,555 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 104 [2018-10-26 22:23:02,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:23:02,558 INFO L225 Difference]: With dead ends: 724 [2018-10-26 22:23:02,558 INFO L226 Difference]: Without dead ends: 585 [2018-10-26 22:23:02,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 98 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-10-26 22:23:02,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-10-26 22:23:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 565. [2018-10-26 22:23:02,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-10-26 22:23:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 621 transitions. [2018-10-26 22:23:02,657 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 621 transitions. Word has length 104 [2018-10-26 22:23:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:23:02,658 INFO L481 AbstractCegarLoop]: Abstraction has 565 states and 621 transitions. [2018-10-26 22:23:02,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 22:23:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 621 transitions. [2018-10-26 22:23:02,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-26 22:23:02,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:23:02,660 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:23:02,660 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:23:02,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:23:02,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1629711969, now seen corresponding path program 3 times [2018-10-26 22:23:02,660 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:23:02,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:23:02,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:23:02,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:23:02,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:23:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:23:03,339 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-26 22:23:03,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:23:03,339 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:23:03,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:23:03,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-26 22:23:03,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:23:03,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:23:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 45 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-26 22:23:05,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:23:05,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-10-26 22:23:05,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-26 22:23:05,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-26 22:23:05,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=321, Unknown=3, NotChecked=0, Total=380 [2018-10-26 22:23:05,776 INFO L87 Difference]: Start difference. First operand 565 states and 621 transitions. Second operand 20 states. [2018-10-26 22:23:25,427 WARN L179 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-26 22:23:40,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:23:40,172 INFO L93 Difference]: Finished difference Result 3252 states and 3587 transitions. [2018-10-26 22:23:40,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-26 22:23:40,172 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 113 [2018-10-26 22:23:40,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:23:40,180 INFO L225 Difference]: With dead ends: 3252 [2018-10-26 22:23:40,180 INFO L226 Difference]: Without dead ends: 2959 [2018-10-26 22:23:40,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=213, Invalid=1578, Unknown=15, NotChecked=0, Total=1806 [2018-10-26 22:23:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2018-10-26 22:23:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 702. [2018-10-26 22:23:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-10-26 22:23:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 771 transitions. [2018-10-26 22:23:40,336 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 771 transitions. Word has length 113 [2018-10-26 22:23:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:23:40,336 INFO L481 AbstractCegarLoop]: Abstraction has 702 states and 771 transitions. [2018-10-26 22:23:40,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-26 22:23:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 771 transitions. [2018-10-26 22:23:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 22:23:40,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:23:40,338 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:23:40,338 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:23:40,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:23:40,339 INFO L82 PathProgramCache]: Analyzing trace with hash -156290083, now seen corresponding path program 4 times [2018-10-26 22:23:40,339 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:23:40,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:23:40,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:23:40,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:23:40,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:23:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:23:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 34 proven. 53 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-10-26 22:23:41,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:23:41,337 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:23:41,344 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:23:41,388 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:23:41,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:23:41,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:23:41,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 27 [2018-10-26 22:23:41,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-10-26 22:23:41,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:23:41,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2018-10-26 22:23:41,865 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:23:41,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:23:41,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:23:41,870 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:27, output treesize:4 [2018-10-26 22:23:41,914 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 36 proven. 83 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-26 22:23:41,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:23:41,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-10-26 22:23:41,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-26 22:23:41,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-26 22:23:41,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2018-10-26 22:23:41,936 INFO L87 Difference]: Start difference. First operand 702 states and 771 transitions. Second operand 29 states. [2018-10-26 22:23:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:23:47,057 INFO L93 Difference]: Finished difference Result 1460 states and 1598 transitions. [2018-10-26 22:23:47,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-26 22:23:47,058 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 124 [2018-10-26 22:23:47,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:23:47,061 INFO L225 Difference]: With dead ends: 1460 [2018-10-26 22:23:47,061 INFO L226 Difference]: Without dead ends: 1223 [2018-10-26 22:23:47,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 121 SyntacticMatches, 11 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1103, Invalid=5059, Unknown=0, NotChecked=0, Total=6162 [2018-10-26 22:23:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2018-10-26 22:23:47,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 944. [2018-10-26 22:23:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-10-26 22:23:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1026 transitions. [2018-10-26 22:23:47,272 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1026 transitions. Word has length 124 [2018-10-26 22:23:47,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:23:47,272 INFO L481 AbstractCegarLoop]: Abstraction has 944 states and 1026 transitions. [2018-10-26 22:23:47,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-26 22:23:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1026 transitions. [2018-10-26 22:23:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 22:23:47,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:23:47,274 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:23:47,274 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:23:47,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:23:47,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1744637985, now seen corresponding path program 5 times [2018-10-26 22:23:47,274 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:23:47,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:23:47,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:23:47,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:23:47,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:23:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:23:47,971 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 22:23:48,194 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 22:23:48,656 WARN L179 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-10-26 22:23:49,410 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 28 [2018-10-26 22:23:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 20 proven. 94 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-26 22:23:50,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:23:50,160 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:23:50,167 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 22:23:50,965 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-26 22:23:50,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:23:50,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:23:51,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-10-26 22:23:51,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-10-26 22:23:51,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:23:51,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:23:51,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:23:51,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2018-10-26 22:23:52,335 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:23:52,336 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:23:52,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-10-26 22:23:52,356 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 37 [2018-10-26 22:23:52,359 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-26 22:23:52,377 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:23:52,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-10-26 22:23:52,378 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:23:52,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:23:52,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:23:52,391 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:4 [2018-10-26 22:23:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 20 proven. 140 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 22:23:52,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:23:52,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 44 [2018-10-26 22:23:52,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-26 22:23:52,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-26 22:23:52,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1634, Unknown=0, NotChecked=0, Total=1892 [2018-10-26 22:23:52,477 INFO L87 Difference]: Start difference. First operand 944 states and 1026 transitions. Second operand 44 states. [2018-10-26 22:23:57,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:23:57,660 INFO L93 Difference]: Finished difference Result 3609 states and 3941 transitions. [2018-10-26 22:23:57,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-26 22:23:57,660 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 124 [2018-10-26 22:23:57,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:23:57,668 INFO L225 Difference]: With dead ends: 3609 [2018-10-26 22:23:57,669 INFO L226 Difference]: Without dead ends: 2932 [2018-10-26 22:23:57,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 98 SyntacticMatches, 15 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=824, Invalid=5028, Unknown=0, NotChecked=0, Total=5852 [2018-10-26 22:23:57,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2018-10-26 22:23:58,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1546. [2018-10-26 22:23:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-10-26 22:23:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1681 transitions. [2018-10-26 22:23:58,006 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 1681 transitions. Word has length 124 [2018-10-26 22:23:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:23:58,006 INFO L481 AbstractCegarLoop]: Abstraction has 1546 states and 1681 transitions. [2018-10-26 22:23:58,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-26 22:23:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1681 transitions. [2018-10-26 22:23:58,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 22:23:58,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:23:58,009 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:23:58,009 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:23:58,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:23:58,010 INFO L82 PathProgramCache]: Analyzing trace with hash -562493149, now seen corresponding path program 3 times [2018-10-26 22:23:58,010 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:23:58,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:23:58,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:23:58,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:23:58,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:23:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:23:58,731 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 22:24:00,364 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 20 proven. 94 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-26 22:24:00,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:24:00,365 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:24:00,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:24:00,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-26 22:24:00,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:24:00,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:24:04,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 30 [2018-10-26 22:24:04,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:24:04,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-26 22:24:04,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:24:04,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 22:24:04,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:30 [2018-10-26 22:24:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 9 proven. 98 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-26 22:24:04,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:24:04,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 38 [2018-10-26 22:24:04,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-26 22:24:04,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-26 22:24:04,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2018-10-26 22:24:04,923 INFO L87 Difference]: Start difference. First operand 1546 states and 1681 transitions. Second operand 38 states. [2018-10-26 22:24:05,883 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-10-26 22:24:09,579 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-26 22:24:13,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:24:13,337 INFO L93 Difference]: Finished difference Result 2248 states and 2425 transitions. [2018-10-26 22:24:13,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-26 22:24:13,337 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 124 [2018-10-26 22:24:13,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:24:13,343 INFO L225 Difference]: With dead ends: 2248 [2018-10-26 22:24:13,344 INFO L226 Difference]: Without dead ends: 2130 [2018-10-26 22:24:13,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 110 SyntacticMatches, 9 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3221 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=1175, Invalid=9331, Unknown=0, NotChecked=0, Total=10506 [2018-10-26 22:24:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2018-10-26 22:24:13,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1583. [2018-10-26 22:24:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2018-10-26 22:24:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 1712 transitions. [2018-10-26 22:24:13,676 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 1712 transitions. Word has length 124 [2018-10-26 22:24:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:24:13,677 INFO L481 AbstractCegarLoop]: Abstraction has 1583 states and 1712 transitions. [2018-10-26 22:24:13,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-26 22:24:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1712 transitions. [2018-10-26 22:24:13,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 22:24:13,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:24:13,679 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:24:13,680 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:24:13,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:24:13,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1084248157, now seen corresponding path program 4 times [2018-10-26 22:24:13,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:24:13,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:24:13,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:24:13,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:24:13,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:24:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:24:14,459 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 22:24:14,932 WARN L179 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 17 [2018-10-26 22:24:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-26 22:24:15,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:24:15,924 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:24:15,933 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:24:15,978 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:24:15,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:24:15,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:24:16,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 28 [2018-10-26 22:24:16,211 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:24:16,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-10-26 22:24:16,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:16,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-10-26 22:24:16,242 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:16,264 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:24:16,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-10-26 22:24:16,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:16,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:16,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:16,281 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2018-10-26 22:24:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 36 proven. 83 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-26 22:24:16,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:24:16,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 25 [2018-10-26 22:24:16,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-26 22:24:16,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-26 22:24:16,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-10-26 22:24:16,347 INFO L87 Difference]: Start difference. First operand 1583 states and 1712 transitions. Second operand 25 states. [2018-10-26 22:24:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:24:18,158 INFO L93 Difference]: Finished difference Result 1982 states and 2137 transitions. [2018-10-26 22:24:18,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 22:24:18,159 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 124 [2018-10-26 22:24:18,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:24:18,164 INFO L225 Difference]: With dead ends: 1982 [2018-10-26 22:24:18,164 INFO L226 Difference]: Without dead ends: 1730 [2018-10-26 22:24:18,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 115 SyntacticMatches, 11 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2018-10-26 22:24:18,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2018-10-26 22:24:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1452. [2018-10-26 22:24:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2018-10-26 22:24:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1565 transitions. [2018-10-26 22:24:18,493 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1565 transitions. Word has length 124 [2018-10-26 22:24:18,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:24:18,493 INFO L481 AbstractCegarLoop]: Abstraction has 1452 states and 1565 transitions. [2018-10-26 22:24:18,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-26 22:24:18,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1565 transitions. [2018-10-26 22:24:18,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 22:24:18,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:24:18,495 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:24:18,496 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:24:18,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:24:18,496 INFO L82 PathProgramCache]: Analyzing trace with hash 5122494, now seen corresponding path program 2 times [2018-10-26 22:24:18,496 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:24:18,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:24:18,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:24:18,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:24:18,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:24:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:24:19,601 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2018-10-26 22:24:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:24:19,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:24:19,916 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:24:19,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:24:20,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:24:20,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:24:20,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:24:20,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 26 [2018-10-26 22:24:20,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-10-26 22:24:20,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:20,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 22:24:20,406 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:20,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:20,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:20,413 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-10-26 22:24:20,468 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 20 proven. 107 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-26 22:24:20,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:24:20,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18] total 26 [2018-10-26 22:24:20,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-26 22:24:20,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-26 22:24:20,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2018-10-26 22:24:20,489 INFO L87 Difference]: Start difference. First operand 1452 states and 1565 transitions. Second operand 26 states. [2018-10-26 22:24:30,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:24:30,849 INFO L93 Difference]: Finished difference Result 3777 states and 4057 transitions. [2018-10-26 22:24:30,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-26 22:24:30,853 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 127 [2018-10-26 22:24:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:24:30,864 INFO L225 Difference]: With dead ends: 3777 [2018-10-26 22:24:30,865 INFO L226 Difference]: Without dead ends: 3292 [2018-10-26 22:24:30,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1577 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=811, Invalid=4889, Unknown=0, NotChecked=0, Total=5700 [2018-10-26 22:24:30,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2018-10-26 22:24:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 1392. [2018-10-26 22:24:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2018-10-26 22:24:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1503 transitions. [2018-10-26 22:24:31,181 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1503 transitions. Word has length 127 [2018-10-26 22:24:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:24:31,182 INFO L481 AbstractCegarLoop]: Abstraction has 1392 states and 1503 transitions. [2018-10-26 22:24:31,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-26 22:24:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1503 transitions. [2018-10-26 22:24:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-26 22:24:31,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:24:31,183 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:24:31,184 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:24:31,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:24:31,184 INFO L82 PathProgramCache]: Analyzing trace with hash -49126908, now seen corresponding path program 6 times [2018-10-26 22:24:31,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:24:31,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:24:31,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:24:31,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:24:31,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:24:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:24:31,861 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 22:24:32,077 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 22:24:32,820 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-10-26 22:24:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 79 proven. 86 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-10-26 22:24:33,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:24:33,491 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 22:24:33,501 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:24:34,236 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-26 22:24:34,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:24:34,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:24:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 79 proven. 94 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-26 22:24:34,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:24:34,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 26 [2018-10-26 22:24:34,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-26 22:24:34,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-26 22:24:34,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2018-10-26 22:24:34,470 INFO L87 Difference]: Start difference. First operand 1392 states and 1503 transitions. Second operand 26 states. [2018-10-26 22:24:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:24:35,944 INFO L93 Difference]: Finished difference Result 2046 states and 2207 transitions. [2018-10-26 22:24:35,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 22:24:35,945 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 142 [2018-10-26 22:24:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:24:35,950 INFO L225 Difference]: With dead ends: 2046 [2018-10-26 22:24:35,950 INFO L226 Difference]: Without dead ends: 1685 [2018-10-26 22:24:35,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 134 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2018-10-26 22:24:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2018-10-26 22:24:36,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1249. [2018-10-26 22:24:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1249 states. [2018-10-26 22:24:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1351 transitions. [2018-10-26 22:24:36,257 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1351 transitions. Word has length 142 [2018-10-26 22:24:36,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:24:36,258 INFO L481 AbstractCegarLoop]: Abstraction has 1249 states and 1351 transitions. [2018-10-26 22:24:36,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-26 22:24:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1351 transitions. [2018-10-26 22:24:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-26 22:24:36,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:24:36,259 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:24:36,260 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:24:36,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:24:36,260 INFO L82 PathProgramCache]: Analyzing trace with hash 110789382, now seen corresponding path program 5 times [2018-10-26 22:24:36,260 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:24:36,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:24:36,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:24:36,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:24:36,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:24:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:24:37,263 WARN L179 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2018-10-26 22:24:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2018-10-26 22:24:37,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:24:37,751 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:24:37,758 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 22:24:38,999 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-26 22:24:39,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:24:39,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:24:39,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-10-26 22:24:39,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-10-26 22:24:39,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:39,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:39,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:39,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-26 22:24:39,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 18 [2018-10-26 22:24:39,175 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:24:39,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-10-26 22:24:39,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:39,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:39,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:39,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:4 [2018-10-26 22:24:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-26 22:24:39,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:24:39,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 20 [2018-10-26 22:24:39,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-26 22:24:39,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-26 22:24:39,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-10-26 22:24:39,263 INFO L87 Difference]: Start difference. First operand 1249 states and 1351 transitions. Second operand 20 states. [2018-10-26 22:24:40,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:24:40,400 INFO L93 Difference]: Finished difference Result 1685 states and 1833 transitions. [2018-10-26 22:24:40,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 22:24:40,401 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 144 [2018-10-26 22:24:40,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:24:40,407 INFO L225 Difference]: With dead ends: 1685 [2018-10-26 22:24:40,407 INFO L226 Difference]: Without dead ends: 1681 [2018-10-26 22:24:40,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2018-10-26 22:24:40,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2018-10-26 22:24:40,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1282. [2018-10-26 22:24:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2018-10-26 22:24:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1384 transitions. [2018-10-26 22:24:40,690 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1384 transitions. Word has length 144 [2018-10-26 22:24:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:24:40,691 INFO L481 AbstractCegarLoop]: Abstraction has 1282 states and 1384 transitions. [2018-10-26 22:24:40,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-26 22:24:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1384 transitions. [2018-10-26 22:24:40,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-26 22:24:40,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:24:40,692 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:24:40,692 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:24:40,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:24:40,693 INFO L82 PathProgramCache]: Analyzing trace with hash -453745213, now seen corresponding path program 7 times [2018-10-26 22:24:40,693 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:24:40,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:24:40,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:24:40,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:24:40,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:24:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:24:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-10-26 22:24:41,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:24:41,795 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:24:41,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:24:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:24:41,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:24:42,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2018-10-26 22:24:42,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-10-26 22:24:42,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:42,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:42,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:42,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-10-26 22:24:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-10-26 22:24:42,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:24:42,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 27 [2018-10-26 22:24:42,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-26 22:24:42,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-26 22:24:42,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2018-10-26 22:24:42,398 INFO L87 Difference]: Start difference. First operand 1282 states and 1384 transitions. Second operand 27 states. [2018-10-26 22:24:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:24:47,358 INFO L93 Difference]: Finished difference Result 10015 states and 11007 transitions. [2018-10-26 22:24:47,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-26 22:24:47,359 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 151 [2018-10-26 22:24:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:24:47,374 INFO L225 Difference]: With dead ends: 10015 [2018-10-26 22:24:47,374 INFO L226 Difference]: Without dead ends: 9435 [2018-10-26 22:24:47,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=271, Invalid=2179, Unknown=0, NotChecked=0, Total=2450 [2018-10-26 22:24:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9435 states. [2018-10-26 22:24:48,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9435 to 2682. [2018-10-26 22:24:48,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2018-10-26 22:24:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 2901 transitions. [2018-10-26 22:24:48,085 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 2901 transitions. Word has length 151 [2018-10-26 22:24:48,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:24:48,086 INFO L481 AbstractCegarLoop]: Abstraction has 2682 states and 2901 transitions. [2018-10-26 22:24:48,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-26 22:24:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 2901 transitions. [2018-10-26 22:24:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-26 22:24:48,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:24:48,091 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:24:48,091 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:24:48,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:24:48,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1522775769, now seen corresponding path program 8 times [2018-10-26 22:24:48,091 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:24:48,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:24:48,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:24:48,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:24:48,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:24:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:24:48,821 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 22:24:49,043 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 22:24:49,622 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 38 [2018-10-26 22:24:50,193 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2018-10-26 22:24:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 66 proven. 207 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-26 22:24:50,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:24:50,999 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:24:51,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:24:51,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:24:51,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:24:51,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:24:51,595 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-26 22:24:52,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 27 [2018-10-26 22:24:52,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-10-26 22:24:52,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:52,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-26 22:24:52,586 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:52,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2018-10-26 22:24:52,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:52,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:52,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:52,603 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:27, output treesize:4 [2018-10-26 22:24:52,695 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 62 proven. 232 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-26 22:24:52,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:24:52,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19] total 36 [2018-10-26 22:24:52,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-26 22:24:52,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-26 22:24:52,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2018-10-26 22:24:52,716 INFO L87 Difference]: Start difference. First operand 2682 states and 2901 transitions. Second operand 36 states. [2018-10-26 22:24:58,946 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-10-26 22:25:00,659 WARN L179 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-10-26 22:25:01,124 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-10-26 22:25:21,797 WARN L179 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-10-26 22:25:30,069 WARN L179 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-10-26 22:25:36,244 WARN L179 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2018-10-26 22:25:36,692 WARN L179 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-26 22:26:28,458 WARN L179 SmtUtils]: Spent 5.34 s on a formula simplification. DAG size of input: 56 DAG size of output: 47 Received shutdown request... [2018-10-26 22:26:34,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-26 22:26:34,516 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 22:26:34,520 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 22:26:34,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:26:34 BoogieIcfgContainer [2018-10-26 22:26:34,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:26:34,521 INFO L168 Benchmark]: Toolchain (without parser) took 252851.09 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 986.2 MB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -960.8 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2018-10-26 22:26:34,522 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 22:26:34,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-26 22:26:34,522 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 22:26:34,523 INFO L168 Benchmark]: Boogie Preprocessor took 39.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 22:26:34,523 INFO L168 Benchmark]: RCFGBuilder took 702.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2018-10-26 22:26:34,523 INFO L168 Benchmark]: TraceAbstraction took 251741.03 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 244.8 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -190.3 MB). Peak memory consumption was 54.6 MB. Max. memory is 7.1 GB. [2018-10-26 22:26:34,525 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 312.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 702.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251741.03 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 244.8 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -190.3 MB). Peak memory consumption was 54.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 6]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 6). Cancelled while BasicCegarLoop was constructing difference of abstraction (2682states) and FLOYD_HOARE automaton (currently 37 states, 36 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 58 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 61 locations, 1 error locations. TIMEOUT Result, 251.6s OverallTime, 26 OverallIterations, 9 TraceHistogramMax, 193.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2278 SDtfs, 13729 SDslu, 20056 SDs, 0 SdLazy, 20653 SolverSat, 2155 SolverUnsat, 77 SolverUnknown, 0 SolverNotchecked, 106.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3200 GetRequests, 2207 SyntacticMatches, 115 SemanticMatches, 877 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12230 ImplicationChecksByTransitivity, 108.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2682occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 20132 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 5.4s SatisfiabilityAnalysisTime, 46.2s InterpolantComputationTime, 4860 NumberOfCodeBlocks, 4743 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 4810 ConstructedInterpolants, 43 QuantifiedInterpolants, 6161405 SizeOfPredicates, 209 NumberOfNonLiveVariables, 5258 ConjunctsInSsa, 726 ConjunctsInUnsatCore, 50 InterpolantComputations, 5 PerfectInterpolantSequences, 3615/6112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown