java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/rew.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 11:40:59,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 11:40:59,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 11:40:59,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 11:40:59,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 11:40:59,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 11:40:59,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 11:40:59,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 11:40:59,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 11:40:59,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 11:40:59,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 11:40:59,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 11:40:59,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 11:40:59,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 11:40:59,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 11:40:59,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 11:40:59,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 11:40:59,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 11:40:59,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 11:40:59,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 11:40:59,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 11:40:59,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 11:40:59,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 11:40:59,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 11:40:59,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 11:40:59,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 11:40:59,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 11:40:59,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 11:40:59,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 11:40:59,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 11:40:59,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 11:40:59,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 11:40:59,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 11:40:59,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 11:40:59,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 11:40:59,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 11:40:59,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 11:40:59,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 11:40:59,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 11:40:59,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 11:40:59,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 11:40:59,590 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 11:40:59,613 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 11:40:59,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 11:40:59,616 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 11:40:59,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 11:40:59,616 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 11:40:59,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 11:40:59,617 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 11:40:59,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 11:40:59,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 11:40:59,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 11:40:59,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 11:40:59,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 11:40:59,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 11:40:59,619 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 11:40:59,619 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 11:40:59,620 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 11:40:59,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 11:40:59,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 11:40:59,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 11:40:59,621 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 11:40:59,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 11:40:59,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:40:59,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 11:40:59,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 11:40:59,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 11:40:59,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 11:40:59,622 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 11:40:59,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 11:40:59,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 11:40:59,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 11:40:59,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 11:40:59,700 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 11:40:59,701 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 11:40:59,702 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 11:40:59,703 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rew.c [2019-09-07 11:40:59,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5267d5a22/d964a5d73dec456b9908d74d5c43cd9f/FLAG3f966f9ce [2019-09-07 11:41:00,194 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 11:41:00,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rew.c [2019-09-07 11:41:00,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5267d5a22/d964a5d73dec456b9908d74d5c43cd9f/FLAG3f966f9ce [2019-09-07 11:41:00,537 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5267d5a22/d964a5d73dec456b9908d74d5c43cd9f [2019-09-07 11:41:00,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 11:41:00,548 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 11:41:00,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 11:41:00,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 11:41:00,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 11:41:00,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:41:00" (1/1) ... [2019-09-07 11:41:00,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae3b6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:41:00, skipping insertion in model container [2019-09-07 11:41:00,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:41:00" (1/1) ... [2019-09-07 11:41:00,565 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 11:41:00,589 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 11:41:00,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:41:00,785 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 11:41:00,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:41:00,817 INFO L192 MainTranslator]: Completed translation [2019-09-07 11:41:00,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:41:00 WrapperNode [2019-09-07 11:41:00,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 11:41:00,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 11:41:00,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 11:41:00,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 11:41:00,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:41:00" (1/1) ... [2019-09-07 11:41:00,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:41:00" (1/1) ... [2019-09-07 11:41:00,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:41:00" (1/1) ... [2019-09-07 11:41:00,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:41:00" (1/1) ... [2019-09-07 11:41:00,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:41:00" (1/1) ... [2019-09-07 11:41:00,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:41:00" (1/1) ... [2019-09-07 11:41:00,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:41:00" (1/1) ... [2019-09-07 11:41:00,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 11:41:00,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 11:41:00,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 11:41:00,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 11:41:00,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:41:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 11:41:01,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 11:41:01,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 11:41:01,005 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 11:41:01,005 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 11:41:01,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 11:41:01,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-07 11:41:01,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 11:41:01,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 11:41:01,006 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-07 11:41:01,006 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 11:41:01,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-07 11:41:01,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 11:41:01,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 11:41:01,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 11:41:01,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 11:41:01,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 11:41:01,259 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 11:41:01,260 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-07 11:41:01,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:41:01 BoogieIcfgContainer [2019-09-07 11:41:01,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 11:41:01,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 11:41:01,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 11:41:01,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 11:41:01,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:41:00" (1/3) ... [2019-09-07 11:41:01,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2c5e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:41:01, skipping insertion in model container [2019-09-07 11:41:01,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:41:00" (2/3) ... [2019-09-07 11:41:01,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2c5e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:41:01, skipping insertion in model container [2019-09-07 11:41:01,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:41:01" (3/3) ... [2019-09-07 11:41:01,269 INFO L109 eAbstractionObserver]: Analyzing ICFG rew.c [2019-09-07 11:41:01,278 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 11:41:01,287 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 11:41:01,304 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 11:41:01,333 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 11:41:01,333 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 11:41:01,334 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 11:41:01,334 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 11:41:01,334 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 11:41:01,334 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 11:41:01,334 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 11:41:01,334 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 11:41:01,335 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 11:41:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-07 11:41:01,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-07 11:41:01,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:41:01,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:41:01,360 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:41:01,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:41:01,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1294486485, now seen corresponding path program 1 times [2019-09-07 11:41:01,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:41:01,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:41:01,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:01,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:41:01,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:41:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:41:01,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:41:01,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 11:41:01,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 11:41:01,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 11:41:01,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:41:01,525 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-07 11:41:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:41:01,547 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-09-07 11:41:01,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 11:41:01,549 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-09-07 11:41:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:41:01,557 INFO L225 Difference]: With dead ends: 43 [2019-09-07 11:41:01,557 INFO L226 Difference]: Without dead ends: 22 [2019-09-07 11:41:01,561 INFO L628 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 [2019-09-07 11:41:01,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-07 11:41:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-07 11:41:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-07 11:41:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-07 11:41:01,598 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-09-07 11:41:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:41:01,598 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-07 11:41:01,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 11:41:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-07 11:41:01,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-07 11:41:01,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:41:01,600 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:41:01,600 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:41:01,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:41:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1653126776, now seen corresponding path program 1 times [2019-09-07 11:41:01,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:41:01,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:41:01,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:01,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:41:01,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:41:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:41:01,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:41:01,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:41:01,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:41:01,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:41:01,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:41:01,705 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-09-07 11:41:01,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:41:01,757 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-09-07 11:41:01,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:41:01,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-07 11:41:01,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:41:01,759 INFO L225 Difference]: With dead ends: 41 [2019-09-07 11:41:01,759 INFO L226 Difference]: Without dead ends: 26 [2019-09-07 11:41:01,761 INFO L628 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 [2019-09-07 11:41:01,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-07 11:41:01,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-09-07 11:41:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-07 11:41:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-07 11:41:01,768 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-09-07 11:41:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:41:01,768 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-07 11:41:01,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:41:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-07 11:41:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 11:41:01,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:41:01,769 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:41:01,770 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:41:01,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:41:01,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1007604157, now seen corresponding path program 1 times [2019-09-07 11:41:01,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:41:01,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:41:01,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:01,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:41:01,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:41:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:41:01,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:41:01,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 11:41:01,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:41:01,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:41:01,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:41:01,848 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2019-09-07 11:41:01,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:41:01,918 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-09-07 11:41:01,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:41:01,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-09-07 11:41:01,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:41:01,920 INFO L225 Difference]: With dead ends: 38 [2019-09-07 11:41:01,920 INFO L226 Difference]: Without dead ends: 27 [2019-09-07 11:41:01,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:41:01,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-07 11:41:01,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-07 11:41:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 11:41:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-07 11:41:01,929 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2019-09-07 11:41:01,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:41:01,930 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-07 11:41:01,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:41:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-07 11:41:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 11:41:01,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:41:01,931 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:41:01,932 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:41:01,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:41:01,932 INFO L82 PathProgramCache]: Analyzing trace with hash -2051596356, now seen corresponding path program 1 times [2019-09-07 11:41:01,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:41:01,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:41:01,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:01,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:41:01,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:41:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:41:02,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:41:02,353 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:41:02,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:41:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:41:02,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:41:02,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:41:02,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 11:41:02,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:02,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:02,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:41:02,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-09-07 11:41:02,607 INFO L341 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-09-07 11:41:02,608 INFO L375 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 1 case distinctions, treesize of input 27 treesize of output 22 [2019-09-07 11:41:02,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:02,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:02,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-07 11:41:02,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:33 [2019-09-07 11:41:02,721 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:02,722 INFO L375 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 34 treesize of output 22 [2019-09-07 11:41:02,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:02,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:02,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:41:02,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:7 [2019-09-07 11:41:02,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:41:02,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:41:02,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-09-07 11:41:02,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 11:41:02,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 11:41:02,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-09-07 11:41:02,820 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 18 states. [2019-09-07 11:41:04,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:41:04,045 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-09-07 11:41:04,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 11:41:04,046 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-09-07 11:41:04,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:41:04,047 INFO L225 Difference]: With dead ends: 42 [2019-09-07 11:41:04,048 INFO L226 Difference]: Without dead ends: 40 [2019-09-07 11:41:04,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:41:04,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-07 11:41:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-09-07 11:41:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-07 11:41:04,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-09-07 11:41:04,066 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2019-09-07 11:41:04,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:41:04,069 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-09-07 11:41:04,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 11:41:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-09-07 11:41:04,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 11:41:04,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:41:04,071 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:41:04,072 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:41:04,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:41:04,072 INFO L82 PathProgramCache]: Analyzing trace with hash -730987952, now seen corresponding path program 1 times [2019-09-07 11:41:04,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:41:04,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:41:04,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:04,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:41:04,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:41:04,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:41:04,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:41:04,292 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 11:41:04,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:41:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:41:04,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:41:04,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:41:04,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 11:41:04,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:04,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:04,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:41:04,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-09-07 11:41:04,661 INFO L375 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 19 treesize of output 7 [2019-09-07 11:41:04,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:04,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:04,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:41:04,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 11:41:04,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:41:04,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:41:04,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2019-09-07 11:41:04,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 11:41:04,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 11:41:04,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:41:04,745 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 22 states. [2019-09-07 11:41:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:41:20,182 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2019-09-07 11:41:20,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 11:41:20,182 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-09-07 11:41:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:41:20,188 INFO L225 Difference]: With dead ends: 74 [2019-09-07 11:41:20,188 INFO L226 Difference]: Without dead ends: 72 [2019-09-07 11:41:20,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2019-09-07 11:41:20,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-07 11:41:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-09-07 11:41:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-07 11:41:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-09-07 11:41:20,207 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 30 [2019-09-07 11:41:20,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:41:20,208 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-09-07 11:41:20,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 11:41:20,210 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-09-07 11:41:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 11:41:20,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:41:20,212 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:41:20,212 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:41:20,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:41:20,212 INFO L82 PathProgramCache]: Analyzing trace with hash 515182859, now seen corresponding path program 2 times [2019-09-07 11:41:20,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:41:20,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:41:20,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:20,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:41:20,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:41:20,502 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:41:20,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:41:20,502 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:41:20,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:41:20,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:41:20,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:41:20,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 11:41:20,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:41:20,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 11:41:20,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:20,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:20,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:41:20,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-09-07 11:41:20,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:20,705 INFO L375 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 31 treesize of output 24 [2019-09-07 11:41:20,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:20,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:20,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-07 11:41:20,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:38 [2019-09-07 11:41:20,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:20,982 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:20,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2019-09-07 11:41:20,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:20,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:20,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:41:20,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:7 [2019-09-07 11:41:21,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:21,065 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:41:21,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:41:21,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2019-09-07 11:41:21,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 11:41:21,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 11:41:21,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:41:21,069 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 28 states. [2019-09-07 11:41:34,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:41:34,064 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2019-09-07 11:41:34,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 11:41:34,064 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-09-07 11:41:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:41:34,066 INFO L225 Difference]: With dead ends: 84 [2019-09-07 11:41:34,066 INFO L226 Difference]: Without dead ends: 82 [2019-09-07 11:41:34,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=310, Invalid=1852, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 11:41:34,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-07 11:41:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 41. [2019-09-07 11:41:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-07 11:41:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-09-07 11:41:34,076 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 34 [2019-09-07 11:41:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:41:34,077 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-09-07 11:41:34,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 11:41:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-09-07 11:41:34,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-07 11:41:34,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:41:34,078 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:41:34,078 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:41:34,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:41:34,079 INFO L82 PathProgramCache]: Analyzing trace with hash 783487204, now seen corresponding path program 3 times [2019-09-07 11:41:34,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:41:34,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:41:34,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:34,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:41:34,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:41:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:41:34,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:41:34,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 11:41:34,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:41:34,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 11:41:34,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:41:34,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 11:41:34,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:41:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:41:34,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:41:34,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2019-09-07 11:41:34,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 11:41:34,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 11:41:34,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:41:34,257 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 13 states. [2019-09-07 11:41:34,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:41:34,469 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-09-07 11:41:34,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 11:41:34,470 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-09-07 11:41:34,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:41:34,472 INFO L225 Difference]: With dead ends: 112 [2019-09-07 11:41:34,472 INFO L226 Difference]: Without dead ends: 59 [2019-09-07 11:41:34,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-07 11:41:34,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-07 11:41:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2019-09-07 11:41:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-07 11:41:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-09-07 11:41:34,491 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2019-09-07 11:41:34,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:41:34,491 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-09-07 11:41:34,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 11:41:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-09-07 11:41:34,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 11:41:34,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:41:34,496 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:41:34,496 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:41:34,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:41:34,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1309226143, now seen corresponding path program 4 times [2019-09-07 11:41:34,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:41:34,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:41:34,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:34,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:41:34,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:41:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:41:34,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:41:34,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 11:41:34,695 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:41:34,716 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:41:34,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:41:34,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 11:41:34,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:41:34,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 11:41:34,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:34,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:34,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:41:34,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-09-07 11:41:35,056 INFO L375 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 19 treesize of output 7 [2019-09-07 11:41:35,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:35,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:35,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:41:35,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 11:41:35,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 11:41:35,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:41:35,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2019-09-07 11:41:35,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 11:41:35,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 11:41:35,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:41:35,152 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 26 states. [2019-09-07 11:41:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:41:51,818 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-09-07 11:41:51,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 11:41:51,818 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2019-09-07 11:41:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:41:51,819 INFO L225 Difference]: With dead ends: 94 [2019-09-07 11:41:51,820 INFO L226 Difference]: Without dead ends: 92 [2019-09-07 11:41:51,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 11:41:51,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-07 11:41:51,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 61. [2019-09-07 11:41:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-07 11:41:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-09-07 11:41:51,836 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 42 [2019-09-07 11:41:51,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:41:51,836 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-09-07 11:41:51,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 11:41:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-09-07 11:41:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 11:41:51,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:41:51,838 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:41:51,838 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:41:51,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:41:51,843 INFO L82 PathProgramCache]: Analyzing trace with hash -908000550, now seen corresponding path program 5 times [2019-09-07 11:41:51,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:41:51,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:41:51,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:51,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:41:51,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:41:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:41:52,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:41:52,124 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 11:41:52,137 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:41:52,183 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-07 11:41:52,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:41:52,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 11:41:52,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:41:52,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 11:41:52,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:52,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:52,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:41:52,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-09-07 11:41:52,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:52,354 INFO L375 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 31 treesize of output 24 [2019-09-07 11:41:52,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:52,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:52,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-07 11:41:52,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:36 [2019-09-07 11:41:53,211 WARN L188 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-09-07 11:41:54,494 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-09-07 11:41:55,403 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-09-07 11:41:55,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:55,409 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:55,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-09-07 11:41:55,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:55,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:55,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:41:55,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2019-09-07 11:41:55,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:55,507 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:41:55,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:41:55,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-09-07 11:41:55,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 11:41:55,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 11:41:55,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=866, Unknown=4, NotChecked=0, Total=992 [2019-09-07 11:41:55,513 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 32 states. [2019-09-07 11:42:16,929 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-09-07 11:42:19,475 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-07 11:42:20,083 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-09-07 11:42:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:42:20,918 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2019-09-07 11:42:20,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 11:42:20,919 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 46 [2019-09-07 11:42:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:42:20,920 INFO L225 Difference]: With dead ends: 104 [2019-09-07 11:42:20,920 INFO L226 Difference]: Without dead ends: 102 [2019-09-07 11:42:20,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=386, Invalid=2795, Unknown=11, NotChecked=0, Total=3192 [2019-09-07 11:42:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-07 11:42:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 53. [2019-09-07 11:42:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-07 11:42:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-09-07 11:42:20,935 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 46 [2019-09-07 11:42:20,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:42:20,935 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-09-07 11:42:20,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 11:42:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-09-07 11:42:20,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 11:42:20,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:42:20,937 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:42:20,937 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:42:20,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:42:20,938 INFO L82 PathProgramCache]: Analyzing trace with hash -65371085, now seen corresponding path program 6 times [2019-09-07 11:42:20,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:42:20,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:42:20,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:42:20,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:42:20,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:42:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:42:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 11:42:21,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:42:21,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 11:42:21,060 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:42:21,086 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-07 11:42:21,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:42:21,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 11:42:21,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:42:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 11:42:21,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:42:21,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2019-09-07 11:42:21,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 11:42:21,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 11:42:21,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:42:21,166 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 16 states. [2019-09-07 11:42:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:42:21,383 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2019-09-07 11:42:21,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 11:42:21,383 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2019-09-07 11:42:21,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:42:21,384 INFO L225 Difference]: With dead ends: 110 [2019-09-07 11:42:21,384 INFO L226 Difference]: Without dead ends: 71 [2019-09-07 11:42:21,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:42:21,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-07 11:42:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2019-09-07 11:42:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-07 11:42:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-07 11:42:21,395 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 50 [2019-09-07 11:42:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:42:21,396 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-07 11:42:21,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 11:42:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-07 11:42:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-07 11:42:21,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:42:21,397 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:42:21,397 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:42:21,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:42:21,398 INFO L82 PathProgramCache]: Analyzing trace with hash -301340818, now seen corresponding path program 7 times [2019-09-07 11:42:21,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:42:21,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:42:21,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:42:21,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:42:21,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:42:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:42:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 11:42:21,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:42:21,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:42:21,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:42:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:42:21,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 11:42:21,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:42:21,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 11:42:21,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:21,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:21,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:21,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-09-07 11:42:22,115 INFO L375 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 19 treesize of output 7 [2019-09-07 11:42:22,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:22,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:22,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:22,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 11:42:22,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 11:42:22,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:42:22,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2019-09-07 11:42:22,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 11:42:22,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 11:42:22,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2019-09-07 11:42:22,199 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 30 states. [2019-09-07 11:42:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:42:41,599 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2019-09-07 11:42:41,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 11:42:41,599 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-09-07 11:42:41,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:42:41,600 INFO L225 Difference]: With dead ends: 114 [2019-09-07 11:42:41,601 INFO L226 Difference]: Without dead ends: 112 [2019-09-07 11:42:41,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=1540, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 11:42:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-07 11:42:41,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 73. [2019-09-07 11:42:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-07 11:42:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-09-07 11:42:41,623 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 54 [2019-09-07 11:42:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:42:41,623 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-09-07 11:42:41,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 11:42:41,624 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-09-07 11:42:41,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-07 11:42:41,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:42:41,625 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:42:41,625 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:42:41,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:42:41,628 INFO L82 PathProgramCache]: Analyzing trace with hash -959498967, now seen corresponding path program 8 times [2019-09-07 11:42:41,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:42:41,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:42:41,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:42:41,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:42:41,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:42:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:42:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 11:42:42,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:42:42,008 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 11:42:42,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:42:42,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:42:42,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:42:42,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 11:42:42,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:42:42,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 11:42:42,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:42,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:42,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:42,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-09-07 11:42:42,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:42:42,232 INFO L375 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 31 treesize of output 24 [2019-09-07 11:42:42,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:42,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:42,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-07 11:42:42,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:38 [2019-09-07 11:42:44,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:42:44,048 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:44,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2019-09-07 11:42:44,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:44,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:44,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:44,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:7 [2019-09-07 11:42:44,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:44,143 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 11:42:44,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:42:44,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-09-07 11:42:44,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 11:42:44,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 11:42:44,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1123, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 11:42:44,148 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 36 states. [2019-09-07 11:43:03,472 WARN L188 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-09-07 11:43:08,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:43:08,318 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-09-07 11:43:08,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 11:43:08,318 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 58 [2019-09-07 11:43:08,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:43:08,321 INFO L225 Difference]: With dead ends: 124 [2019-09-07 11:43:08,321 INFO L226 Difference]: Without dead ends: 122 [2019-09-07 11:43:08,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=404, Invalid=3502, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 11:43:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-07 11:43:08,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 65. [2019-09-07 11:43:08,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-07 11:43:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-09-07 11:43:08,334 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 58 [2019-09-07 11:43:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:43:08,335 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-09-07 11:43:08,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 11:43:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-09-07 11:43:08,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 11:43:08,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:43:08,336 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:43:08,337 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:43:08,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:43:08,337 INFO L82 PathProgramCache]: Analyzing trace with hash 345962498, now seen corresponding path program 9 times [2019-09-07 11:43:08,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:43:08,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:43:08,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:43:08,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:43:08,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:43:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:43:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 27 proven. 41 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 11:43:08,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:43:08,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 11:43:08,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:43:08,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 11:43:08,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:43:08,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 11:43:08,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:43:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 11:43:08,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:43:08,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 19 [2019-09-07 11:43:08,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 11:43:08,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 11:43:08,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:43:08,584 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 19 states. [2019-09-07 11:43:08,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:43:08,885 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2019-09-07 11:43:08,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 11:43:08,886 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2019-09-07 11:43:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:43:08,887 INFO L225 Difference]: With dead ends: 130 [2019-09-07 11:43:08,887 INFO L226 Difference]: Without dead ends: 83 [2019-09-07 11:43:08,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:43:08,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-07 11:43:08,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2019-09-07 11:43:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-07 11:43:08,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-09-07 11:43:08,907 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 62 [2019-09-07 11:43:08,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:43:08,908 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-09-07 11:43:08,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 11:43:08,908 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-09-07 11:43:08,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 11:43:08,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:43:08,909 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:43:08,909 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:43:08,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:43:08,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1002724029, now seen corresponding path program 10 times [2019-09-07 11:43:08,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:43:08,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:43:08,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:43:08,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:43:08,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:43:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:43:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 8 proven. 77 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 11:43:09,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:43:09,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 11:43:09,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:43:09,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:43:09,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:43:09,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 11:43:09,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:43:09,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 11:43:09,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:43:09,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:43:09,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:43:09,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-09-07 11:43:09,923 INFO L375 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 19 treesize of output 7 [2019-09-07 11:43:09,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:43:09,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:43:09,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:43:09,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 11:43:09,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:43:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:43:10,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:43:10,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2019-09-07 11:43:10,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 11:43:10,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 11:43:10,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 11:43:10,027 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 34 states. [2019-09-07 11:43:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:43:37,284 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2019-09-07 11:43:37,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 11:43:37,284 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-09-07 11:43:37,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:43:37,286 INFO L225 Difference]: With dead ends: 134 [2019-09-07 11:43:37,286 INFO L226 Difference]: Without dead ends: 132 [2019-09-07 11:43:37,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=209, Invalid=2047, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 11:43:37,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-07 11:43:37,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 85. [2019-09-07 11:43:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-07 11:43:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2019-09-07 11:43:37,311 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 66 [2019-09-07 11:43:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:43:37,311 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2019-09-07 11:43:37,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 11:43:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2019-09-07 11:43:37,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-07 11:43:37,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:43:37,312 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:43:37,312 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:43:37,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:43:37,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1212946440, now seen corresponding path program 11 times [2019-09-07 11:43:37,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:43:37,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:43:37,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:43:37,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:43:37,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:43:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:43:37,663 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 8 proven. 98 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 11:43:37,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:43:37,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 11:43:37,691 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:43:37,789 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-07 11:43:37,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:43:37,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 11:43:37,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:43:38,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 11:43:38,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:43:38,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:43:38,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:43:38,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-09-07 11:43:38,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:43:38,132 INFO L375 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 29 treesize of output 22 [2019-09-07 11:43:38,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:43:38,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:43:38,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:43:38,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 11:43:38,725 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:43:38,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-07 11:43:38,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:43:38,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:43:38,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:43:38,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:7 [2019-09-07 11:43:38,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:43:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 3 proven. 112 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 11:43:38,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:43:38,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 37 [2019-09-07 11:43:38,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 11:43:38,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 11:43:38,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1210, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 11:43:38,826 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand 37 states. [2019-09-07 11:44:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:44:03,623 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2019-09-07 11:44:03,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 11:44:03,623 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2019-09-07 11:44:03,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:44:03,625 INFO L225 Difference]: With dead ends: 213 [2019-09-07 11:44:03,626 INFO L226 Difference]: Without dead ends: 211 [2019-09-07 11:44:03,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=443, Invalid=4669, Unknown=0, NotChecked=0, Total=5112 [2019-09-07 11:44:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-07 11:44:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 175. [2019-09-07 11:44:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-07 11:44:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 187 transitions. [2019-09-07 11:44:03,663 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 187 transitions. Word has length 70 [2019-09-07 11:44:03,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:44:03,663 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 187 transitions. [2019-09-07 11:44:03,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 11:44:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 187 transitions. [2019-09-07 11:44:03,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-07 11:44:03,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:44:03,665 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:44:03,665 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:44:03,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:44:03,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2024493999, now seen corresponding path program 12 times [2019-09-07 11:44:03,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:44:03,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:44:03,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:44:03,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:44:03,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:44:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:44:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 43 proven. 62 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-07 11:44:03,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:44:03,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 11:44:03,806 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:44:03,848 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-09-07 11:44:03,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:44:03,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 11:44:03,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:44:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 60 proven. 45 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-07 11:44:03,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:44:03,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 22 [2019-09-07 11:44:03,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 11:44:03,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 11:44:03,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:44:03,986 INFO L87 Difference]: Start difference. First operand 175 states and 187 transitions. Second operand 22 states. [2019-09-07 11:44:04,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:44:04,380 INFO L93 Difference]: Finished difference Result 218 states and 229 transitions. [2019-09-07 11:44:04,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 11:44:04,386 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 74 [2019-09-07 11:44:04,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:44:04,387 INFO L225 Difference]: With dead ends: 218 [2019-09-07 11:44:04,387 INFO L226 Difference]: Without dead ends: 163 [2019-09-07 11:44:04,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=657, Unknown=0, NotChecked=0, Total=870 [2019-09-07 11:44:04,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-07 11:44:04,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 153. [2019-09-07 11:44:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-07 11:44:04,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 161 transitions. [2019-09-07 11:44:04,416 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 161 transitions. Word has length 74 [2019-09-07 11:44:04,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:44:04,417 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 161 transitions. [2019-09-07 11:44:04,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 11:44:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2019-09-07 11:44:04,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-07 11:44:04,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:44:04,418 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:44:04,419 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:44:04,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:44:04,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1680638446, now seen corresponding path program 13 times [2019-09-07 11:44:04,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:44:04,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:44:04,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:44:04,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:44:04,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:44:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:44:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 8 proven. 152 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 11:44:04,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:44:04,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:44:04,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:44:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:44:04,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-07 11:44:04,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:44:05,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 11:44:05,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:44:05,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:44:05,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:44:05,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-09-07 11:44:05,204 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:44:05,205 INFO L375 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 1 case distinctions, treesize of input 26 treesize of output 57 [2019-09-07 11:44:05,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:44:05,232 INFO L567 ElimStorePlain]: treesize reduction 32, result has 49.2 percent of original size [2019-09-07 11:44:05,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:44:05,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 11:44:05,320 INFO L341 Elim1Store]: treesize reduction 54, result has 49.1 percent of original size [2019-09-07 11:44:05,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 69 [2019-09-07 11:44:05,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:44:05,354 INFO L567 ElimStorePlain]: treesize reduction 30, result has 58.3 percent of original size [2019-09-07 11:44:05,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:44:05,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-09-07 11:44:05,515 INFO L341 Elim1Store]: treesize reduction 125, result has 34.2 percent of original size [2019-09-07 11:44:05,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 83 [2019-09-07 11:44:05,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:44:05,553 INFO L567 ElimStorePlain]: treesize reduction 41, result has 55.4 percent of original size [2019-09-07 11:44:05,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:44:05,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2019-09-07 11:44:05,677 INFO L341 Elim1Store]: treesize reduction 160, result has 32.8 percent of original size [2019-09-07 11:44:05,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 57 treesize of output 98 [2019-09-07 11:44:05,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:44:05,714 INFO L567 ElimStorePlain]: treesize reduction 53, result has 44.2 percent of original size [2019-09-07 11:44:05,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:44:05,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:42 [2019-09-07 11:44:05,846 INFO L341 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2019-09-07 11:44:05,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 46 [2019-09-07 11:44:05,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:44:05,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:44:05,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:44:05,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:58 [2019-09-07 11:44:56,667 INFO L341 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-09-07 11:44:56,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 16 [2019-09-07 11:44:56,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:44:56,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:44:56,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:44:56,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:7 [2019-09-07 11:44:56,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:44:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 11:44:56,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:44:56,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 47 [2019-09-07 11:44:56,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 11:44:56,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 11:44:56,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1948, Unknown=5, NotChecked=0, Total=2162 [2019-09-07 11:44:56,886 INFO L87 Difference]: Start difference. First operand 153 states and 161 transitions. Second operand 47 states. [2019-09-07 11:45:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:45:47,808 INFO L93 Difference]: Finished difference Result 245 states and 258 transitions. [2019-09-07 11:45:47,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 11:45:47,809 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 78 [2019-09-07 11:45:47,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:45:47,811 INFO L225 Difference]: With dead ends: 245 [2019-09-07 11:45:47,811 INFO L226 Difference]: Without dead ends: 243 [2019-09-07 11:45:47,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1864 ImplicationChecksByTransitivity, 55.1s TimeCoverageRelationStatistics Valid=599, Invalid=5401, Unknown=6, NotChecked=0, Total=6006 [2019-09-07 11:45:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-07 11:45:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 163. [2019-09-07 11:45:47,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-07 11:45:47,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 171 transitions. [2019-09-07 11:45:47,841 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 171 transitions. Word has length 78 [2019-09-07 11:45:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:45:47,841 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 171 transitions. [2019-09-07 11:45:47,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 11:45:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 171 transitions. [2019-09-07 11:45:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-07 11:45:47,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:45:47,842 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:45:47,843 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:45:47,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:45:47,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1318888633, now seen corresponding path program 14 times [2019-09-07 11:45:47,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:45:47,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:45:47,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:47,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:45:47,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 10 proven. 141 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-07 11:45:48,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:45:48,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 11:45:48,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:45:48,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:45:48,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:45:48,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 11:45:48,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:45:48,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 11:45:48,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:48,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:48,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:48,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-09-07 11:45:48,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:45:48,428 INFO L375 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 31 treesize of output 24 [2019-09-07 11:45:48,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:48,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:48,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-07 11:45:48,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:36 [2019-09-07 11:45:49,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:45:49,340 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:49,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-09-07 11:45:49,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:49,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:49,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:49,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2019-09-07 11:45:49,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 11:45:49,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:45:49,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2019-09-07 11:45:49,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 11:45:49,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 11:45:49,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1508, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 11:45:49,466 INFO L87 Difference]: Start difference. First operand 163 states and 171 transitions. Second operand 41 states. [2019-09-07 11:46:12,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:46:12,992 INFO L93 Difference]: Finished difference Result 230 states and 237 transitions. [2019-09-07 11:46:12,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 11:46:12,993 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 82 [2019-09-07 11:46:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:46:12,995 INFO L225 Difference]: With dead ends: 230 [2019-09-07 11:46:12,995 INFO L226 Difference]: Without dead ends: 228 [2019-09-07 11:46:12,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1456 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=407, Invalid=4563, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 11:46:12,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-09-07 11:46:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 163. [2019-09-07 11:46:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-07 11:46:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 170 transitions. [2019-09-07 11:46:13,025 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 170 transitions. Word has length 82 [2019-09-07 11:46:13,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:46:13,026 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 170 transitions. [2019-09-07 11:46:13,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 11:46:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 170 transitions. [2019-09-07 11:46:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-07 11:46:13,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:13,027 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:13,028 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:13,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:13,028 INFO L82 PathProgramCache]: Analyzing trace with hash -2047876832, now seen corresponding path program 15 times [2019-09-07 11:46:13,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:13,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:13,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:13,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:46:13,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 63 proven. 87 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 11:46:13,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:46:13,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 11:46:13,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:46:13,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-07 11:46:13,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:46:13,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 11:46:13,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:46:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 84 proven. 66 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 11:46:13,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:46:13,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 25 [2019-09-07 11:46:13,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 11:46:13,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 11:46:13,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:46:13,379 INFO L87 Difference]: Start difference. First operand 163 states and 170 transitions. Second operand 25 states. [2019-09-07 11:46:13,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:46:13,780 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2019-09-07 11:46:13,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 11:46:13,780 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 86 [2019-09-07 11:46:13,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:46:13,782 INFO L225 Difference]: With dead ends: 234 [2019-09-07 11:46:13,783 INFO L226 Difference]: Without dead ends: 171 [2019-09-07 11:46:13,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 11:46:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-07 11:46:13,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 163. [2019-09-07 11:46:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-07 11:46:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 169 transitions. [2019-09-07 11:46:13,810 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 169 transitions. Word has length 86 [2019-09-07 11:46:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:46:13,811 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 169 transitions. [2019-09-07 11:46:13,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 11:46:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 169 transitions. [2019-09-07 11:46:13,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-07 11:46:13,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:13,812 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:13,812 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:13,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:13,812 INFO L82 PathProgramCache]: Analyzing trace with hash -623410469, now seen corresponding path program 16 times [2019-09-07 11:46:13,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:13,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:13,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:13,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:46:13,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 12 proven. 163 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 11:46:14,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:46:14,145 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 11:46:14,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:46:14,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:46:14,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:46:14,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-07 11:46:14,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:46:14,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 11:46:14,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:14,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:14,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:14,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-09-07 11:46:15,169 INFO L375 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 19 treesize of output 7 [2019-09-07 11:46:15,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:15,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:15,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:15,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 11:46:15,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:46:15,284 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 11:46:15,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:46:15,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 42 [2019-09-07 11:46:15,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-07 11:46:15,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-07 11:46:15,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1594, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 11:46:15,289 INFO L87 Difference]: Start difference. First operand 163 states and 169 transitions. Second operand 42 states. [2019-09-07 11:46:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:46:45,695 INFO L93 Difference]: Finished difference Result 236 states and 242 transitions. [2019-09-07 11:46:45,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 11:46:45,696 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 90 [2019-09-07 11:46:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:46:45,698 INFO L225 Difference]: With dead ends: 236 [2019-09-07 11:46:45,698 INFO L226 Difference]: Without dead ends: 234 [2019-09-07 11:46:45,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 59 SyntacticMatches, 11 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=263, Invalid=3277, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 11:46:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-07 11:46:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 175. [2019-09-07 11:46:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-07 11:46:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 181 transitions. [2019-09-07 11:46:45,731 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 181 transitions. Word has length 90 [2019-09-07 11:46:45,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:46:45,732 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 181 transitions. [2019-09-07 11:46:45,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-07 11:46:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 181 transitions. [2019-09-07 11:46:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-07 11:46:45,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:45,733 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:45,733 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:45,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:45,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1959057007, now seen corresponding path program 17 times [2019-09-07 11:46:45,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:45,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:45,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:45,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:46:45,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:45,912 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 87 proven. 116 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 11:46:45,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:46:45,912 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 11:46:45,924 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:46:45,995 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-07 11:46:45,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:46:45,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:46:45,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:46:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 112 proven. 91 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 11:46:46,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:46:46,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 28 [2019-09-07 11:46:46,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 11:46:46,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 11:46:46,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:46:46,157 INFO L87 Difference]: Start difference. First operand 175 states and 181 transitions. Second operand 28 states. [2019-09-07 11:46:46,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:46:46,626 INFO L93 Difference]: Finished difference Result 246 states and 254 transitions. [2019-09-07 11:46:46,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 11:46:46,629 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 98 [2019-09-07 11:46:46,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:46:46,630 INFO L225 Difference]: With dead ends: 246 [2019-09-07 11:46:46,630 INFO L226 Difference]: Without dead ends: 175 [2019-09-07 11:46:46,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=334, Invalid=1072, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 11:46:46,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-07 11:46:46,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 163. [2019-09-07 11:46:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-07 11:46:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 168 transitions. [2019-09-07 11:46:46,658 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 168 transitions. Word has length 98 [2019-09-07 11:46:46,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:46:46,658 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 168 transitions. [2019-09-07 11:46:46,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 11:46:46,658 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 168 transitions. [2019-09-07 11:46:46,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-07 11:46:46,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:46,660 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:46,660 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:46,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:46,660 INFO L82 PathProgramCache]: Analyzing trace with hash -197564660, now seen corresponding path program 18 times [2019-09-07 11:46:46,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:46,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:46,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:46,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:46:46,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:47,319 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 14 proven. 260 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 11:46:47,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:46:47,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 11:46:47,330 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:46:47,519 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-07 11:46:47,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:46:47,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-07 11:46:47,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:46:47,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 11:46:47,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:47,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:47,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:47,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-09-07 11:46:47,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:47,851 INFO L375 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 26 treesize of output 25 [2019-09-07 11:46:47,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:47,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:47,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:47,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-09-07 11:46:47,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:47,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:47,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:47,917 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:47,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2019-09-07 11:46:47,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:47,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:47,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:47,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-09-07 11:46:48,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:48,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:48,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:48,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:48,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:48,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:48,092 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:48,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2019-09-07 11:46:48,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:48,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:48,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-07 11:46:48,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:63, output treesize:59 [2019-09-07 11:46:48,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:48,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:48,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:48,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:48,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:48,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:48,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:48,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:48,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:48,274 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:48,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 104 [2019-09-07 11:46:48,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:48,331 INFO L567 ElimStorePlain]: treesize reduction 26, result has 76.1 percent of original size [2019-09-07 11:46:48,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:46:48,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-07 11:46:48,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:83 [2019-09-07 11:46:48,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:46:48,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:46:50,917 WARN L188 SmtUtils]: Spent 2.40 s on a formula simplification that was a NOOP. DAG size: 50 [2019-09-07 11:46:51,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:46:51,127 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_int_36|], 30=[v_prenex_20]} [2019-09-07 11:46:51,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 67 [2019-09-07 11:46:51,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:51,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:51,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,279 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:51,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 154 [2019-09-07 11:46:51,281 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:51,400 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-07 11:46:51,401 INFO L567 ElimStorePlain]: treesize reduction 64, result has 75.8 percent of original size [2019-09-07 11:46:51,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:46:51,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-09-07 11:46:51,404 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:186, output treesize:200 [2019-09-07 11:46:51,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:12,031 WARN L188 SmtUtils]: Spent 16.49 s on a formula simplification that was a NOOP. DAG size: 69 [2019-09-07 11:47:12,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,576 WARN L188 SmtUtils]: Spent 25.39 s on a formula simplification that was a NOOP. DAG size: 75 [2019-09-07 11:48:15,245 WARN L188 SmtUtils]: Spent 25.06 s on a formula simplification that was a NOOP. DAG size: 88 [2019-09-07 11:48:33,943 WARN L188 SmtUtils]: Spent 6.02 s on a formula simplification that was a NOOP. DAG size: 77 [2019-09-07 11:49:50,369 WARN L188 SmtUtils]: Spent 1.20 m on a formula simplification. DAG size of input: 162 DAG size of output: 88 [2019-09-07 11:50:25,947 WARN L188 SmtUtils]: Spent 31.41 s on a formula simplification that was a NOOP. DAG size: 88 [2019-09-07 11:52:09,918 WARN L188 SmtUtils]: Spent 1.49 m on a formula simplification. DAG size of input: 162 DAG size of output: 116 [2019-09-07 11:53:19,657 WARN L188 SmtUtils]: Spent 1.09 m on a formula simplification. DAG size of input: 116 DAG size of output: 88 [2019-09-07 11:55:28,358 WARN L188 SmtUtils]: Spent 1.87 m on a formula simplification. DAG size of input: 162 DAG size of output: 88