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/rewnifrev2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 21:50:39,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:50:39,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:50:39,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:50:39,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:50:39,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:50:39,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:50:39,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:50:39,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:50:39,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:50:39,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:50:39,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:50:39,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:50:39,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:50:39,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:50:39,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:50:39,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:50:39,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:50:39,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:50:39,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:50:39,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:50:39,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:50:39,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:50:39,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:50:39,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:50:39,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:50:39,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:50:39,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:50:39,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:50:39,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:50:39,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:50:39,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:50:39,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:50:39,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:50:39,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:50:39,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:50:39,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:50:39,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:50:39,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:50:39,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:50:39,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:50:39,420 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-10-14 21:50:39,435 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:50:39,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:50:39,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:50:39,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:50:39,437 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:50:39,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:50:39,438 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:50:39,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:50:39,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:50:39,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:50:39,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:50:39,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:50:39,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:50:39,439 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:50:39,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:50:39,440 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:50:39,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:50:39,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:50:39,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:50:39,440 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:50:39,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:50:39,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:50:39,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:50:39,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:50:39,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:50:39,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:50:39,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:50:39,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:50:39,442 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:50:39,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:50:39,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:50:39,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:50:39,799 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:50:39,800 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:50:39,800 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewnifrev2.c [2019-10-14 21:50:39,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f451c62a9/56d6e94f19ec49278a26229659704125/FLAGb28ffa527 [2019-10-14 21:50:40,321 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:50:40,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewnifrev2.c [2019-10-14 21:50:40,328 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f451c62a9/56d6e94f19ec49278a26229659704125/FLAGb28ffa527 [2019-10-14 21:50:40,746 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f451c62a9/56d6e94f19ec49278a26229659704125 [2019-10-14 21:50:40,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:50:40,760 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:50:40,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:40,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:50:40,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:50:40,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:40" (1/1) ... [2019-10-14 21:50:40,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469e4dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:40, skipping insertion in model container [2019-10-14 21:50:40,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:40" (1/1) ... [2019-10-14 21:50:40,772 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:50:40,785 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:50:40,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:40,976 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:50:40,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:41,007 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:50:41,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:41 WrapperNode [2019-10-14 21:50:41,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:41,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:50:41,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:50:41,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:50:41,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:41" (1/1) ... [2019-10-14 21:50:41,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:41" (1/1) ... [2019-10-14 21:50:41,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:41" (1/1) ... [2019-10-14 21:50:41,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:41" (1/1) ... [2019-10-14 21:50:41,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:41" (1/1) ... [2019-10-14 21:50:41,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:41" (1/1) ... [2019-10-14 21:50:41,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:41" (1/1) ... [2019-10-14 21:50:41,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:50:41,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:50:41,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:50:41,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:50:41,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:41" (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-10-14 21:50:41,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:50:41,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:50:41,186 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 21:50:41,186 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:50:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:50:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 21:50:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 21:50:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 21:50:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 21:50:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:50:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 21:50:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 21:50:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 21:50:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:50:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:50:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 21:50:41,440 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:50:41,446 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 21:50:41,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:41 BoogieIcfgContainer [2019-10-14 21:50:41,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:50:41,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:50:41,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:50:41,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:50:41,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:50:40" (1/3) ... [2019-10-14 21:50:41,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6944ee48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:41, skipping insertion in model container [2019-10-14 21:50:41,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:41" (2/3) ... [2019-10-14 21:50:41,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6944ee48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:41, skipping insertion in model container [2019-10-14 21:50:41,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:41" (3/3) ... [2019-10-14 21:50:41,471 INFO L109 eAbstractionObserver]: Analyzing ICFG rewnifrev2.c [2019-10-14 21:50:41,480 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:50:41,489 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:50:41,500 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:50:41,521 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:50:41,521 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:50:41,522 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:50:41,522 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:50:41,522 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:50:41,522 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:50:41,522 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:50:41,522 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:50:41,537 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-14 21:50:41,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 21:50:41,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:41,543 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:41,545 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:41,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:41,550 INFO L82 PathProgramCache]: Analyzing trace with hash -516860939, now seen corresponding path program 1 times [2019-10-14 21:50:41,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:41,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936165905] [2019-10-14 21:50:41,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:41,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:41,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:41,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936165905] [2019-10-14 21:50:41,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:41,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 21:50:41,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080385210] [2019-10-14 21:50:41,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 21:50:41,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:41,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 21:50:41,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 21:50:41,770 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2019-10-14 21:50:41,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:41,865 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2019-10-14 21:50:41,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 21:50:41,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-14 21:50:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:41,876 INFO L225 Difference]: With dead ends: 41 [2019-10-14 21:50:41,877 INFO L226 Difference]: Without dead ends: 20 [2019-10-14 21:50:41,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 21:50:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-14 21:50:41,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-14 21:50:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-14 21:50:41,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-10-14 21:50:41,922 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2019-10-14 21:50:41,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:41,923 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-10-14 21:50:41,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 21:50:41,924 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-10-14 21:50:41,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 21:50:41,925 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:41,925 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:41,925 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:41,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:41,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1546915729, now seen corresponding path program 1 times [2019-10-14 21:50:41,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:41,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666992415] [2019-10-14 21:50:41,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:41,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:41,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:42,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666992415] [2019-10-14 21:50:42,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:42,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:42,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583763338] [2019-10-14 21:50:42,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:42,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:42,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:42,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:42,055 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2019-10-14 21:50:42,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:42,146 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-10-14 21:50:42,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:42,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-14 21:50:42,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:42,147 INFO L225 Difference]: With dead ends: 32 [2019-10-14 21:50:42,148 INFO L226 Difference]: Without dead ends: 21 [2019-10-14 21:50:42,149 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-14 21:50:42,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-14 21:50:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-14 21:50:42,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-10-14 21:50:42,156 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2019-10-14 21:50:42,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:42,157 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-14 21:50:42,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:42,157 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-10-14 21:50:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:50:42,158 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:42,158 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:42,159 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:42,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:42,159 INFO L82 PathProgramCache]: Analyzing trace with hash -586037587, now seen corresponding path program 1 times [2019-10-14 21:50:42,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:42,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214093300] [2019-10-14 21:50:42,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:42,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:42,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:42,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214093300] [2019-10-14 21:50:42,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:42,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-14 21:50:42,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765994320] [2019-10-14 21:50:42,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 21:50:42,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:42,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 21:50:42,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-10-14 21:50:42,579 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-10-14 21:50:42,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:42,855 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-10-14 21:50:42,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 21:50:42,855 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-10-14 21:50:42,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:42,856 INFO L225 Difference]: With dead ends: 31 [2019-10-14 21:50:42,856 INFO L226 Difference]: Without dead ends: 29 [2019-10-14 21:50:42,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-10-14 21:50:42,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-14 21:50:42,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-10-14 21:50:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-14 21:50:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-10-14 21:50:42,873 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2019-10-14 21:50:42,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:42,874 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-10-14 21:50:42,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 21:50:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-10-14 21:50:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 21:50:42,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:42,876 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:42,877 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:42,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:42,877 INFO L82 PathProgramCache]: Analyzing trace with hash -798788415, now seen corresponding path program 1 times [2019-10-14 21:50:42,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:42,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124835602] [2019-10-14 21:50:42,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:42,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:42,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:43,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124835602] [2019-10-14 21:50:43,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432586481] [2019-10-14 21:50:43,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:43,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-14 21:50:43,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:43,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:43,295 INFO L341 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-10-14 21:50:43,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2019-10-14 21:50:43,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:43,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:43,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:43,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-10-14 21:50:43,698 INFO L341 Elim1Store]: treesize reduction 17, result has 66.7 percent of original size [2019-10-14 21:50:43,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 45 [2019-10-14 21:50:43,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:43,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:43,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 21:50:43,728 INFO L567 ElimStorePlain]: treesize reduction 50, result has 23.1 percent of original size [2019-10-14 21:50:43,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:43,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:7 [2019-10-14 21:50:43,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:43,811 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:43,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2019-10-14 21:50:43,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128958081] [2019-10-14 21:50:43,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 21:50:43,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:43,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 21:50:43,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2019-10-14 21:50:43,814 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 22 states. [2019-10-14 21:50:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:44,482 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-10-14 21:50:44,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 21:50:44,483 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2019-10-14 21:50:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:44,484 INFO L225 Difference]: With dead ends: 39 [2019-10-14 21:50:44,484 INFO L226 Difference]: Without dead ends: 37 [2019-10-14 21:50:44,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2019-10-14 21:50:44,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-14 21:50:44,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-10-14 21:50:44,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-14 21:50:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-10-14 21:50:44,494 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 24 [2019-10-14 21:50:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:44,494 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-10-14 21:50:44,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 21:50:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-10-14 21:50:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 21:50:44,496 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:44,496 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:44,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:44,700 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:44,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:44,700 INFO L82 PathProgramCache]: Analyzing trace with hash -75510059, now seen corresponding path program 2 times [2019-10-14 21:50:44,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:44,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544807200] [2019-10-14 21:50:44,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:44,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:44,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:44,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544807200] [2019-10-14 21:50:44,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859881889] [2019-10-14 21:50:44,799 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:44,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:50:44,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:44,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-14 21:50:44,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:44,895 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:44,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2019-10-14 21:50:44,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837418088] [2019-10-14 21:50:44,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 21:50:44,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:44,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 21:50:44,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-10-14 21:50:44,897 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 12 states. [2019-10-14 21:50:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:45,052 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-10-14 21:50:45,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 21:50:45,053 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-10-14 21:50:45,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:45,059 INFO L225 Difference]: With dead ends: 66 [2019-10-14 21:50:45,059 INFO L226 Difference]: Without dead ends: 38 [2019-10-14 21:50:45,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-10-14 21:50:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-14 21:50:45,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-10-14 21:50:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-14 21:50:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-10-14 21:50:45,069 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2019-10-14 21:50:45,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:45,069 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-10-14 21:50:45,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 21:50:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-10-14 21:50:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 21:50:45,071 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:45,071 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:45,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:45,275 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:45,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:45,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1971334765, now seen corresponding path program 3 times [2019-10-14 21:50:45,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:45,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750063316] [2019-10-14 21:50:45,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:45,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:45,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:45,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750063316] [2019-10-14 21:50:45,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496513425] [2019-10-14 21:50:45,524 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:45,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 21:50:45,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:45,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-14 21:50:45,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:45,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:45,615 INFO L341 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-10-14 21:50:45,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2019-10-14 21:50:45,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:45,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:45,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:45,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:31 [2019-10-14 21:50:45,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:45,769 INFO L341 Elim1Store]: treesize reduction 132, result has 51.6 percent of original size [2019-10-14 21:50:45,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 163 [2019-10-14 21:50:45,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:45,818 INFO L567 ElimStorePlain]: treesize reduction 106, result has 36.5 percent of original size [2019-10-14 21:50:45,819 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-10-14 21:50:45,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:61 [2019-10-14 21:50:46,931 INFO L341 Elim1Store]: treesize reduction 34, result has 79.9 percent of original size [2019-10-14 21:50:46,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 154 [2019-10-14 21:50:46,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,000 INFO L567 ElimStorePlain]: treesize reduction 260, result has 7.8 percent of original size [2019-10-14 21:50:47,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:78, output treesize:10 [2019-10-14 21:50:47,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 21:50:47,093 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:47,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2019-10-14 21:50:47,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31602649] [2019-10-14 21:50:47,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-14 21:50:47,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:47,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-14 21:50:47,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2019-10-14 21:50:47,095 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 29 states. [2019-10-14 21:50:49,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:49,231 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2019-10-14 21:50:49,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-14 21:50:49,231 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 34 [2019-10-14 21:50:49,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:49,233 INFO L225 Difference]: With dead ends: 78 [2019-10-14 21:50:49,233 INFO L226 Difference]: Without dead ends: 50 [2019-10-14 21:50:49,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=453, Invalid=2739, Unknown=0, NotChecked=0, Total=3192 [2019-10-14 21:50:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-14 21:50:49,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-10-14 21:50:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-14 21:50:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-10-14 21:50:49,246 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 34 [2019-10-14 21:50:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:49,247 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-10-14 21:50:49,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-14 21:50:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-10-14 21:50:49,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-14 21:50:49,248 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:49,248 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:49,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:49,452 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:49,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:49,453 INFO L82 PathProgramCache]: Analyzing trace with hash 734357221, now seen corresponding path program 4 times [2019-10-14 21:50:49,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:49,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018582346] [2019-10-14 21:50:49,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:49,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:49,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:49,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018582346] [2019-10-14 21:50:49,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660925442] [2019-10-14 21:50:49,939 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:49,994 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 21:50:49,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:49,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-14 21:50:49,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:50,033 INFO L341 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-10-14 21:50:50,033 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-10-14 21:50:50,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:50,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:50,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:50,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:26 [2019-10-14 21:50:50,142 INFO L341 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-10-14 21:50:50,142 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 54 treesize of output 48 [2019-10-14 21:50:50,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:50,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:50,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:50,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:40 [2019-10-14 21:50:50,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:50,268 INFO L341 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-10-14 21:50:50,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 65 [2019-10-14 21:50:50,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:50,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:50,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:50,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:57 [2019-10-14 21:50:51,111 INFO L341 Elim1Store]: treesize reduction 105, result has 39.3 percent of original size [2019-10-14 21:50:51,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 89 [2019-10-14 21:50:51,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:51,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:51,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:51,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:51,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 21:50:51,151 INFO L567 ElimStorePlain]: treesize reduction 191, result has 7.3 percent of original size [2019-10-14 21:50:51,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:51,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:7 [2019-10-14 21:50:51,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 21:50:51,243 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:51,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2019-10-14 21:50:51,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596680471] [2019-10-14 21:50:51,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-14 21:50:51,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:51,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-14 21:50:51,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2019-10-14 21:50:51,246 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 34 states. [2019-10-14 21:50:53,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:53,070 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-10-14 21:50:53,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-14 21:50:53,070 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 44 [2019-10-14 21:50:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:53,072 INFO L225 Difference]: With dead ends: 59 [2019-10-14 21:50:53,073 INFO L226 Difference]: Without dead ends: 57 [2019-10-14 21:50:53,075 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=499, Invalid=2693, Unknown=0, NotChecked=0, Total=3192 [2019-10-14 21:50:53,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-14 21:50:53,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-14 21:50:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-14 21:50:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-10-14 21:50:53,085 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 44 [2019-10-14 21:50:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:53,086 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-10-14 21:50:53,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-14 21:50:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-10-14 21:50:53,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-14 21:50:53,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:53,088 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:53,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:53,301 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:53,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:53,302 INFO L82 PathProgramCache]: Analyzing trace with hash -261137159, now seen corresponding path program 5 times [2019-10-14 21:50:53,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:53,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862058158] [2019-10-14 21:50:53,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:53,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:53,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 27 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:50:53,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862058158] [2019-10-14 21:50:53,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725264210] [2019-10-14 21:50:53,430 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:53,511 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-14 21:50:53,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:53,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-14 21:50:53,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:50:53,600 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:53,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2019-10-14 21:50:53,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554055068] [2019-10-14 21:50:53,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 21:50:53,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:53,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 21:50:53,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-10-14 21:50:53,604 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 16 states. [2019-10-14 21:50:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:53,875 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-10-14 21:50:53,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 21:50:53,876 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2019-10-14 21:50:53,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:53,878 INFO L225 Difference]: With dead ends: 102 [2019-10-14 21:50:53,878 INFO L226 Difference]: Without dead ends: 58 [2019-10-14 21:50:53,879 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-10-14 21:50:53,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-14 21:50:53,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-10-14 21:50:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-14 21:50:53,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-10-14 21:50:53,903 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2019-10-14 21:50:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:53,904 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-10-14 21:50:53,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 21:50:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-10-14 21:50:53,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-14 21:50:53,914 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:53,914 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:54,114 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:54,115 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:54,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:54,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1964993353, now seen corresponding path program 6 times [2019-10-14 21:50:54,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:54,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074535863] [2019-10-14 21:50:54,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:54,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:54,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:50:54,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074535863] [2019-10-14 21:50:54,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018995030] [2019-10-14 21:50:54,410 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:54,490 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-14 21:50:54,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:54,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-14 21:50:54,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:54,534 INFO L341 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-10-14 21:50:54,535 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-10-14 21:50:54,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:54,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:54,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:54,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-10-14 21:50:54,627 INFO L341 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-10-14 21:50:54,628 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 54 treesize of output 48 [2019-10-14 21:50:54,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:54,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:54,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:54,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2019-10-14 21:50:54,755 INFO L341 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-10-14 21:50:54,755 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 68 treesize of output 65 [2019-10-14 21:50:54,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:54,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:54,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:54,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:57 [2019-10-14 21:50:54,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:54,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:54,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:54,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:54,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:54,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:54,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:54,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:54,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:54,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:54,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:54,888 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:54,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 82 [2019-10-14 21:50:54,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:54,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:54,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:54,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:88, output treesize:74 [2019-10-14 21:50:56,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:56,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:56,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:56,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:56,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:56,083 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:50:56,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:56,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:56,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:56,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:56,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:56,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:56,092 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:56,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 71 treesize of output 30 [2019-10-14 21:50:56,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:56,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:56,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:56,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:80, output treesize:7 [2019-10-14 21:50:56,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 16 proven. 49 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-14 21:50:56,208 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:56,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 37 [2019-10-14 21:50:56,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483647370] [2019-10-14 21:50:56,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-14 21:50:56,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:56,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-14 21:50:56,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1116, Unknown=0, NotChecked=0, Total=1332 [2019-10-14 21:50:56,209 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 37 states. [2019-10-14 21:50:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:57,740 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-10-14 21:50:57,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-14 21:50:57,741 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 54 [2019-10-14 21:50:57,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:57,743 INFO L225 Difference]: With dead ends: 69 [2019-10-14 21:50:57,743 INFO L226 Difference]: Without dead ends: 67 [2019-10-14 21:50:57,745 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 38 SyntacticMatches, 11 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=500, Invalid=2470, Unknown=0, NotChecked=0, Total=2970 [2019-10-14 21:50:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-14 21:50:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-10-14 21:50:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-14 21:50:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-10-14 21:50:57,757 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 54 [2019-10-14 21:50:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:57,757 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-10-14 21:50:57,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-14 21:50:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-10-14 21:50:57,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-14 21:50:57,759 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:57,759 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:57,967 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:57,967 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:57,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:57,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1406101301, now seen corresponding path program 7 times [2019-10-14 21:50:57,968 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:57,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176108467] [2019-10-14 21:50:57,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:57,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:57,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:58,075 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 43 proven. 33 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-14 21:50:58,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176108467] [2019-10-14 21:50:58,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279042524] [2019-10-14 21:50:58,076 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:58,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-14 21:50:58,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 60 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-14 21:50:58,239 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:58,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 18 [2019-10-14 21:50:58,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543640845] [2019-10-14 21:50:58,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 21:50:58,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:58,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 21:50:58,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-10-14 21:50:58,241 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 18 states. [2019-10-14 21:50:58,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:58,576 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2019-10-14 21:50:58,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 21:50:58,576 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2019-10-14 21:50:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:58,578 INFO L225 Difference]: With dead ends: 120 [2019-10-14 21:50:58,578 INFO L226 Difference]: Without dead ends: 68 [2019-10-14 21:50:58,579 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-10-14 21:50:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-14 21:50:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-10-14 21:50:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-14 21:50:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-10-14 21:50:58,591 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2019-10-14 21:50:58,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:58,592 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-10-14 21:50:58,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 21:50:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-10-14 21:50:58,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-14 21:50:58,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:58,593 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:58,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:58,798 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:58,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:58,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1367718665, now seen corresponding path program 8 times [2019-10-14 21:50:58,799 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:58,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203519287] [2019-10-14 21:50:58,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:58,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:58,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 15 proven. 70 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-14 21:50:59,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203519287] [2019-10-14 21:50:59,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107578571] [2019-10-14 21:50:59,391 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:59,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:50:59,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:59,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-14 21:50:59,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:59,537 INFO L341 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-10-14 21:50:59,537 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-10-14 21:50:59,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:59,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:59,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:59,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-10-14 21:50:59,640 INFO L341 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-10-14 21:50:59,641 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 54 treesize of output 48 [2019-10-14 21:50:59,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:59,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:59,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:59,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2019-10-14 21:50:59,791 INFO L341 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-10-14 21:50:59,791 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 68 treesize of output 65 [2019-10-14 21:50:59,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:59,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:59,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:59,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:57 [2019-10-14 21:50:59,964 INFO L341 Elim1Store]: treesize reduction 430, result has 10.0 percent of original size [2019-10-14 21:50:59,964 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 10 case distinctions, treesize of input 82 treesize of output 82 [2019-10-14 21:50:59,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:59,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:59,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:59,993 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:71 [2019-10-14 21:51:00,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,113 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:00,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 96 treesize of output 99 [2019-10-14 21:51:00,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:00,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:00,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:00,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:88 [2019-10-14 21:51:01,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,773 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:51:01,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:01,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 84 treesize of output 35 [2019-10-14 21:51:01,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:01,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:01,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:01,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:93, output treesize:7 [2019-10-14 21:51:01,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 21 proven. 76 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-14 21:51:01,973 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:01,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 41 [2019-10-14 21:51:01,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175067289] [2019-10-14 21:51:01,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-14 21:51:01,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:01,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-14 21:51:01,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1355, Unknown=0, NotChecked=0, Total=1640 [2019-10-14 21:51:01,975 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 41 states. [2019-10-14 21:51:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:03,853 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-10-14 21:51:03,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-14 21:51:03,854 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 64 [2019-10-14 21:51:03,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:03,856 INFO L225 Difference]: With dead ends: 79 [2019-10-14 21:51:03,857 INFO L226 Difference]: Without dead ends: 77 [2019-10-14 21:51:03,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 45 SyntacticMatches, 15 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=645, Invalid=3015, Unknown=0, NotChecked=0, Total=3660 [2019-10-14 21:51:03,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-14 21:51:03,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-10-14 21:51:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-14 21:51:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-10-14 21:51:03,872 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 64 [2019-10-14 21:51:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:03,873 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-10-14 21:51:03,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-14 21:51:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-10-14 21:51:03,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-14 21:51:03,874 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:03,874 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:51:04,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:04,078 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:04,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:04,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1539617507, now seen corresponding path program 9 times [2019-10-14 21:51:04,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:04,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768190825] [2019-10-14 21:51:04,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:04,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:04,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:04,220 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 63 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-14 21:51:04,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768190825] [2019-10-14 21:51:04,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419185572] [2019-10-14 21:51:04,221 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:04,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-14 21:51:04,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:51:04,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-14 21:51:04,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 84 proven. 25 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-14 21:51:04,539 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:04,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 20 [2019-10-14 21:51:04,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114021811] [2019-10-14 21:51:04,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-14 21:51:04,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:04,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-14 21:51:04,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-10-14 21:51:04,541 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 20 states. [2019-10-14 21:51:04,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:04,854 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2019-10-14 21:51:04,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 21:51:04,855 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-10-14 21:51:04,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:04,856 INFO L225 Difference]: With dead ends: 138 [2019-10-14 21:51:04,857 INFO L226 Difference]: Without dead ends: 78 [2019-10-14 21:51:04,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-10-14 21:51:04,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-14 21:51:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-14 21:51:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-14 21:51:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-10-14 21:51:04,872 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 72 [2019-10-14 21:51:04,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:04,872 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-10-14 21:51:04,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-14 21:51:04,872 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-10-14 21:51:04,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-14 21:51:04,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:04,873 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:51:05,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:05,079 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:05,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:05,079 INFO L82 PathProgramCache]: Analyzing trace with hash -764331557, now seen corresponding path program 10 times [2019-10-14 21:51:05,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:05,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551333785] [2019-10-14 21:51:05,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:05,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:05,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 102 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-14 21:51:05,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551333785] [2019-10-14 21:51:05,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708485974] [2019-10-14 21:51:05,492 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:05,584 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 21:51:05,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:51:05,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-14 21:51:05,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:05,600 INFO L341 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-10-14 21:51:05,600 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-10-14 21:51:05,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:05,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:05,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:05,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:26 [2019-10-14 21:51:05,702 INFO L341 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-10-14 21:51:05,703 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 54 treesize of output 48 [2019-10-14 21:51:05,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:05,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:05,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:05,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:40 [2019-10-14 21:51:05,826 INFO L341 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-10-14 21:51:05,827 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 68 treesize of output 65 [2019-10-14 21:51:05,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:05,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:05,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:05,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2019-10-14 21:51:05,986 INFO L341 Elim1Store]: treesize reduction 430, result has 10.0 percent of original size [2019-10-14 21:51:05,986 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 10 case distinctions, treesize of input 82 treesize of output 82 [2019-10-14 21:51:05,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:06,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:06,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:06,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:68 [2019-10-14 21:51:06,218 INFO L341 Elim1Store]: treesize reduction 596, result has 9.1 percent of original size [2019-10-14 21:51:06,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 99 [2019-10-14 21:51:06,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:06,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:06,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:06,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:96, output treesize:82 [2019-10-14 21:51:06,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:06,490 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 36 [2019-10-14 21:51:06,491 INFO L341 Elim1Store]: treesize reduction 780, result has 8.5 percent of original size [2019-10-14 21:51:06,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 110 treesize of output 116 [2019-10-14 21:51:06,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:06,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:06,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:06,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:99 [2019-10-14 21:51:08,992 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 56 [2019-10-14 21:51:08,993 INFO L341 Elim1Store]: treesize reduction 372, result has 24.2 percent of original size [2019-10-14 21:51:08,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 107 treesize of output 155 [2019-10-14 21:51:08,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:08,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:08,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:08,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:08,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:08,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:08,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:09,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 21:51:09,076 INFO L567 ElimStorePlain]: treesize reduction 566, result has 2.6 percent of original size [2019-10-14 21:51:09,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:09,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:116, output treesize:7 [2019-10-14 21:51:09,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:09,266 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 31 proven. 104 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-14 21:51:09,266 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:09,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 28] total 44 [2019-10-14 21:51:09,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697536090] [2019-10-14 21:51:09,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-14 21:51:09,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:09,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-14 21:51:09,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=1576, Unknown=0, NotChecked=0, Total=1892 [2019-10-14 21:51:09,268 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 44 states. [2019-10-14 21:51:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:11,870 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-10-14 21:51:11,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-14 21:51:11,870 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 74 [2019-10-14 21:51:11,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:11,871 INFO L225 Difference]: With dead ends: 89 [2019-10-14 21:51:11,872 INFO L226 Difference]: Without dead ends: 87 [2019-10-14 21:51:11,873 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 53 SyntacticMatches, 19 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=700, Invalid=3460, Unknown=0, NotChecked=0, Total=4160 [2019-10-14 21:51:11,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-14 21:51:11,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-14 21:51:11,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-14 21:51:11,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-10-14 21:51:11,888 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 74 [2019-10-14 21:51:11,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:11,888 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-10-14 21:51:11,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-14 21:51:11,888 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-10-14 21:51:11,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-14 21:51:11,889 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:11,889 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:51:12,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:12,094 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:12,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:12,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1491851759, now seen corresponding path program 11 times [2019-10-14 21:51:12,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:12,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636833942] [2019-10-14 21:51:12,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:12,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:12,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 87 proven. 61 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-14 21:51:12,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636833942] [2019-10-14 21:51:12,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339006556] [2019-10-14 21:51:12,249 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:12,435 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-10-14 21:51:12,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:51:12,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-14 21:51:12,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 112 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-14 21:51:12,552 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:12,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 22 [2019-10-14 21:51:12,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50285936] [2019-10-14 21:51:12,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 21:51:12,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:12,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 21:51:12,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2019-10-14 21:51:12,554 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 22 states. [2019-10-14 21:51:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:12,934 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-10-14 21:51:12,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-14 21:51:12,934 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 82 [2019-10-14 21:51:12,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:12,936 INFO L225 Difference]: With dead ends: 156 [2019-10-14 21:51:12,936 INFO L226 Difference]: Without dead ends: 88 [2019-10-14 21:51:12,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2019-10-14 21:51:12,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-14 21:51:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-10-14 21:51:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-14 21:51:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-10-14 21:51:12,952 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2019-10-14 21:51:12,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:12,952 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-10-14 21:51:12,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 21:51:12,952 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-10-14 21:51:12,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-14 21:51:12,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:12,953 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:51:13,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:13,157 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:13,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:13,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1600614701, now seen corresponding path program 12 times [2019-10-14 21:51:13,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:13,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933678052] [2019-10-14 21:51:13,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:13,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:13,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 21 proven. 140 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-14 21:51:13,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933678052] [2019-10-14 21:51:13,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931255248] [2019-10-14 21:51:13,644 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:13,766 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-10-14 21:51:13,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:51:13,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-14 21:51:13,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:13,799 INFO L341 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-10-14 21:51:13,800 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-10-14 21:51:13,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:13,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:13,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:13,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-10-14 21:51:13,900 INFO L341 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-10-14 21:51:13,900 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 54 treesize of output 48 [2019-10-14 21:51:13,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:13,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:13,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:13,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2019-10-14 21:51:14,036 INFO L341 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-10-14 21:51:14,036 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 68 treesize of output 65 [2019-10-14 21:51:14,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:14,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:14,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:14,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:57 [2019-10-14 21:51:14,208 INFO L341 Elim1Store]: treesize reduction 430, result has 10.0 percent of original size [2019-10-14 21:51:14,208 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 10 case distinctions, treesize of input 82 treesize of output 82 [2019-10-14 21:51:14,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:14,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:14,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:14,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:71 [2019-10-14 21:51:14,456 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 31 [2019-10-14 21:51:14,457 INFO L341 Elim1Store]: treesize reduction 596, result has 9.1 percent of original size [2019-10-14 21:51:14,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 99 [2019-10-14 21:51:14,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:14,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:14,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:14,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:99, output treesize:85 [2019-10-14 21:51:14,741 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 36 [2019-10-14 21:51:14,742 INFO L341 Elim1Store]: treesize reduction 780, result has 8.5 percent of original size [2019-10-14 21:51:14,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 110 treesize of output 116 [2019-10-14 21:51:14,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:14,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:14,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:14,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:99 [2019-10-14 21:51:14,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:14,955 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:14,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 124 treesize of output 133 [2019-10-14 21:51:14,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:14,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:14,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:14,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:130, output treesize:116 [2019-10-14 21:51:17,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:51:17,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:17,841 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:17,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 45 [2019-10-14 21:51:17,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:17,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:17,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:17,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:119, output treesize:7 [2019-10-14 21:51:17,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 46 proven. 133 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-14 21:51:18,068 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:18,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 33] total 50 [2019-10-14 21:51:18,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894213880] [2019-10-14 21:51:18,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-14 21:51:18,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:18,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-14 21:51:18,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=2009, Unknown=0, NotChecked=0, Total=2450 [2019-10-14 21:51:18,071 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 50 states. [2019-10-14 21:51:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:20,857 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-10-14 21:51:20,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-14 21:51:20,858 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 84 [2019-10-14 21:51:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:20,860 INFO L225 Difference]: With dead ends: 99 [2019-10-14 21:51:20,860 INFO L226 Difference]: Without dead ends: 97 [2019-10-14 21:51:20,863 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 58 SyntacticMatches, 23 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1528 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=926, Invalid=4330, Unknown=0, NotChecked=0, Total=5256 [2019-10-14 21:51:20,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-14 21:51:20,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-10-14 21:51:20,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-14 21:51:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-10-14 21:51:20,881 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 84 [2019-10-14 21:51:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:20,881 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-10-14 21:51:20,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-14 21:51:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-10-14 21:51:20,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-14 21:51:20,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:20,883 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:51:21,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:21,088 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:21,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:21,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1046044863, now seen corresponding path program 13 times [2019-10-14 21:51:21,088 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:21,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641151812] [2019-10-14 21:51:21,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:21,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:21,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:21,253 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 115 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-14 21:51:21,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641151812] [2019-10-14 21:51:21,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402050134] [2019-10-14 21:51:21,254 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:21,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-14 21:51:21,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:21,474 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 144 proven. 49 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-14 21:51:21,475 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:21,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 24 [2019-10-14 21:51:21,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261275939] [2019-10-14 21:51:21,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-14 21:51:21,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:21,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-14 21:51:21,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=359, Unknown=0, NotChecked=0, Total=552 [2019-10-14 21:51:21,476 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 24 states. [2019-10-14 21:51:21,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:21,873 INFO L93 Difference]: Finished difference Result 174 states and 176 transitions. [2019-10-14 21:51:21,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-14 21:51:21,874 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 92 [2019-10-14 21:51:21,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:21,876 INFO L225 Difference]: With dead ends: 174 [2019-10-14 21:51:21,876 INFO L226 Difference]: Without dead ends: 98 [2019-10-14 21:51:21,877 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2019-10-14 21:51:21,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-14 21:51:21,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-10-14 21:51:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-14 21:51:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-10-14 21:51:21,900 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 92 [2019-10-14 21:51:21,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:21,900 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-10-14 21:51:21,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-14 21:51:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-10-14 21:51:21,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-14 21:51:21,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:21,901 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:51:22,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:22,105 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:22,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:22,105 INFO L82 PathProgramCache]: Analyzing trace with hash 523550975, now seen corresponding path program 14 times [2019-10-14 21:51:22,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:22,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745188357] [2019-10-14 21:51:22,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:22,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:22,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 24 proven. 184 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-14 21:51:22,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745188357] [2019-10-14 21:51:22,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557982788] [2019-10-14 21:51:22,630 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:22,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:51:22,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:51:22,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-14 21:51:22,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:22,764 INFO L341 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-10-14 21:51:22,765 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-10-14 21:51:22,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:22,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:22,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:22,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-10-14 21:51:22,890 INFO L341 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-10-14 21:51:22,891 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 54 treesize of output 48 [2019-10-14 21:51:22,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:22,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:22,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:22,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2019-10-14 21:51:23,047 INFO L341 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-10-14 21:51:23,048 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 68 treesize of output 65 [2019-10-14 21:51:23,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:23,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:23,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:23,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:57